EFFICIENCY UNVEILED: ANALYZING THE PERFORMANCE OF RADIX-2 AND RADIX-4 BOOTH MULTIPLIERS
Abstract
Efficiency in digital circuit design is a paramount consideration, and the choice of multiplier architecture plays a pivotal role in achieving optimal computational performance. This study, titled "Efficiency Unveiled: Analyzing the Performance of Radix-2 and Radix-4 Booth Multipliers," undertakes a thorough investigation of these two multiplier architectures to reveal their respective performance characteristics. Through extensive analysis, including speed, power consumption, and resource utilization metrics, this research elucidates the nuanced differences in efficiency between Radix-2 and Radix-4 Booth Multipliers. The findings provide valuable insights for circuit designers and researchers, facilitating informed decisions in selecting the most suitable multiplier architecture for specific digital system requirements.
Keywords
Radix-2 Booth Multiplier, Radix-4 Booth Multiplier, Digital Circuit Design
References
- A High-Speed Multiplication Algorithm Using Modified Partial Product Reduction Tree P. Asadee, International Journal of Electrical and Electronics Engineering, 4: 4, (2010).
- N. Jiang and D. Harris, “Parallelized Radix-2 Scalable Montgomery Multiplier,” submitted to IFIP Intl. Conf. on VLSI, (2007).
- D. Kudeeth., “Implementation of low-power multipliers”, Journal of low-power electronics, vol. 2, 5-11, (2006).
- Y.N. Ching, “Low-power high-speed multipliers”, IEEE Transactions on Computers, vol. 54, no. 3, pp. 355-361, 2005.
- D. Harris, R. Krishnamurthy, M. Anders, S. Mathew, and S. Hsu, “An improved unified scalable radix-2 Montgomery multiplier,” Proc. 17th IEEE Symp. Computer Arithmetic, pp. 172-178, 2005.
- K. Kelley and D. Harris, “Parallelized very high radix scalable Montgomery multipliers,” Proc. Asilomar Conf. Signals, Systems, and Computers, pp. 1196-1200, Nov. (2005).
- J. Hensley, A. Lastra, and M. Singh. An area- and energy- efficient asynchronous booth multiplier for mobile devices. In Proc. Int. Conf. Computer Design (ICCD), (2004).
- Efthymiou, W. Suntiamorntut, J. Garside, and L. Brackenbury. An asynchronous, iterative implementation of the original Booth multiplication algorithm. In Proc. Int. Symp. On Advanced Research in Asynchronous Circuits and Systems, pages 207–215. IEEE Computer Society Press, Apr. (2004).