Design and Implementation of Run-time reconfigurable multi-precision FP multiplier

  • Unique Paper ID: 144666
  • Volume: 4
  • Issue: 2
  • PageNo: 29-34
  • Abstract:
  • Floating Point (FP) multiplication is used based on the need of the application and this work has showed the reconfigurable FP multiplier with six different modes. The different modes give different precision as the modes are divided based on the number of mantissa bits. The complex part of FP multiplication is the Mantissa multiplication that is done with the efficient use of both the Karatsuba and Urdhva algorithm. Here, we had targeted for the decrease in the delay and area and it has been achieved successfully with usage of simple carry select and save adders instead of the ripple carry adders. The fully fledged Double precision multiplier actually consumes more area and also delay is more, here we have reduced the delay by 47 percent approximately in comparison to the reference.
add_icon3email to a friend

Copyright & License

Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

BibTeX

@article{144666,
        author = {M V Sarala Rani and Pradeep S V and Dr Siva Yellampalli},
        title = {Design and Implementation of Run-time reconfigurable multi-precision FP multiplier},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {4},
        number = {2},
        pages = {29-34},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=144666},
        abstract = {Floating Point (FP) multiplication is used based on the need of the application and this work has showed the reconfigurable FP multiplier with six different modes. The different modes give different precision as the modes are divided based on the number of mantissa bits. The complex part of FP multiplication is the Mantissa multiplication that is done with the efficient use of both the Karatsuba and Urdhva algorithm. Here, we had targeted for the decrease in the delay and area and it has been achieved successfully with usage of simple carry select and save adders instead of the ripple carry adders. The fully fledged Double precision multiplier actually consumes more area and also delay is more, here we have reduced the delay by 47 percent approximately in comparison to the reference.},
        keywords = {FP, Multiplier},
        month = {},
        }

Cite This Article

  • ISSN: 2349-6002
  • Volume: 4
  • Issue: 2
  • PageNo: 29-34

Design and Implementation of Run-time reconfigurable multi-precision FP multiplier

Related Articles