Design and Implementation of a Delay and Energy-efficient Booth Multiplier
Keywords:
Booth multiplier, Delay optimization, Digital Signal Processing (DSP), Energy efficiency, FPGA implementation, High-speed multipliers, Low-power design, Partial product reductionAbstract
The performance of digital multipliers plays a critical role in high-speed arithmetic operations used in modern digital signal processing and embedded systems. This project focuses on the design and implementation of a delay and energy-efficient booth multiplier, which is an optimized version of the traditional booth algorithm for signed multiplication. Booth multipliers reduce the number of partial products generated during multiplication, thereby decreasing computation time and hardware complexity. However, conventional designs often suffer from high propagation delay and increased power consumption. In this work, an enhanced booth multiplier architecture is proposed, incorporating optimized partial product generation, fast adders, and low-power design techniques to minimize delay and energy usage. The proposed design is implemented using Hardware Description Languages (HDL) such as VHDL or Verilog and validated on FPGA platforms to ensure real-time performance. Simulation results demonstrate significant improvements in speed and power efficiency compared to conventional multipliers. The proposed multiplier is highly suitable for applications in digital signal processing, embedded systems, and arithmetic-intensive computing environments where energy efficiency and low latency are critical. This work contributes to the development of high-performance arithmetic units for modern computational systems.
References
K. Hwang, Computer Arithmetic: Principles, Architecture, and Design. New York, NY, USA: Wiley, 1979.
A. D. Booth, “A signed binary multiplication technique,” Quarterly Journal of Mechanics and Applied Mathematics, vol. 4, no. 2, pp. 236–240, 1951.
M. D. Ercegovac and T. Lang, Digital Arithmetic. San Francisco, CA, USA: Morgan Kaufmann, 2004.
N. H. E. Weste and D. Harris, CMOS VLSI Design: A Circuits and Systems Perspective, 4th ed. Boston, MA, USA: Pearson, 2011.
S. Knowles, “A family of adders,” in Proc. IEEE Symposium on Computer Arithmetic, 2001, pp. 277–281.
V. G. Oklobdzija, D. Villeger, and S. S. Liu, “A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach,” IEEE Transactions on Computers, vol. 45, no. 3, pp. 294–306, 1996.
R. P. Brent and H. T. Kung, “A regular layout for parallel adders,” IEEE Transactions on Computers, vol. C-31, no. 3, pp. 260–264, 1982.
L. Dadda, “On parallel digital multipliers,” Alta Frequenza, vol. 45, pp. 574–580, 1976.
P. M. Kogge and H. S. Stone, “A parallel algorithm for the efficient solution of a general class of recurrence equations,” IEEE Transactions on Computers, vol. C-22, no. 8, pp. 786–793, 1973.
J. Sklansky, “Conditional-sum addition logic,” IRE Transactions on Electronic Computers, vol. EC-9, pp. 226–231, 1960.
T. K. Callaway and E. E. Swartzlander, Jr., “Optimizing multipliers for WSI,” in Proc. IEEE Symposium on Computer Arithmetic, 1993, pp. 74–81.
S. Sunder, F. El-Guibaly, and A. Antoniou, “Area-efficient VLSI implementation of fast carry-save adders,” IEEE Transactions on Circuits and Systems II, vol. 40, no. 10, pp. 646–650, 1993.
A. Dadda, “Some schemes for parallel multipliers,” Alta Frequenza, vol. 34, pp. 349–356, 1965.
C. S. Wallace, “A suggestion for a fast multiplier,” IEEE Transactions on Electronic Computers, vol. EC-13, no. 1, pp. 14–17, 1964.
O. L. MacSorley, “High-speed arithmetic in binary computers,” Proceedings of the IRE, vol. 49, no. 1, pp. 67–91, 1961.
