A New Redundant Binary Partial Product Generator for Fast 2n-Bit Multiplier Design
Authors:
- Cui XiaopingCXCui Xiaoping
- Hu WeiHWHu Wei
- Chen XinCXChen Xin
- Wang ShuminWSWang Shumin
- 1 December 2014
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 56, 840-844
Abstract
The radix-4 Booth encoding or Modified Booth encoding (MBE) has been widely adopted in partial products generator to design high-speed redundant binary (RB) multipliers. Due to the existence of an error-correcting word (ECW) generated by MBE and RB encoding, the RB multiplier generates an additional RB partial product rows. An extra RB partial product accumulator (RBPPA) stage is needed for 2n-b RB MBE multiplier. The higher radix Booth algorithm than radix-4 can be adopted to reduce the number of partial products. However, the Booth encoding is not efficient because of the difficulty in generating hard multiples. The hard multiples problem in RB multiplier can be resolved by difference of two simple power-of-two multiples. This paper presents a new radix-16 RB Booth Encoding (RBBE-4) to avoid the hard multiple of high-radix Booth encoding without incurring any ECW. The proposed method leads to make high-speed and low-power RB multipliers. The experimental results show that the proposed RBBE-4 multiplier achieves significant improvement in delay and power consumption compared with the RB MBE multiplier and the current reported best RBBE-4 multipliers.Keywords
This publication has 15 references indexed in Scilit:
- A New Redundant Binary Booth Encoding for Fast $2^{n}$-Bit Multiplier DesignIEEE Transactions on Circuits and Systems I: Regular Papers, 2008
- High-speed parallel-prefix VLSI Ling addersIEEE Transactions on Computers, 2005
- A novel redundant binary signed-digit (RBSD) Booth's encoding2003
- A fast parallel multiplier-accumulator using the modified Booth algorithmIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 2000
- High-speed Booth encoded parallel multiplier designIEEE Transactions on Computers, 2000
- An 8.8-ns 54×54-bit multiplier with high speed redundant binary architectureIEEE Journal of Solid-State Circuits, 1996
- A 33 Mflops Floating Point Processor Using Redundant Binary Representation1988
- A high-speed multiplier using a redundant binary adder treeIEEE Journal of Solid-State Circuits, 1987
- High-Speed Arithmetic in Binary ComputersProceedings of the IRE, 1961
- A SIGNED BINARY MULTIPLICATION TECHNIQUEQuarterly Journal of Mechanics and Applied Mathematics, 1951