Reducing the Computation Time in (Short Bit-Width) Two's Complement Multipliers
- 28 June 2010
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 60 (2) , 148-156
Abstract
Two's complement multipliers are important for a wide range of applications. In this paper, we present a technique to reduce by one row the maximum height of the partial product array generated by a radix-4 Modified Booth Encoded multiplier, without any increase in the delay of the partial product generation stage. This reduction may allow for a faster compression of the partial product array and regular layouts. This technique is of particular interest in all multiplier designs, but especially in short bit-width two's complement multipliers for high-performance embedded cores. The proposed method is general and can be extended to higher radix encodings, as well as to any size square and m \times n rectangular multipliers. We evaluated the proposed approach by comparison with some other possible solutions; the results based on a rough theoretical analysis and on logic synthesis showed its efficiency in terms of both area and delay.Keywords
This publication has 16 references indexed in Scilit:
- A 300 mV 494GOPS/W Reconfigurable Dual-Supply 4-Way SIMD Vector Processing Accelerator in 45 nm CMOSIEEE Journal of Solid-State Circuits, 2009
- A 110 GOPS/W 16-bit Multiplier and Reconfigurable PLA Loop in 90-nm CMOSIEEE Journal of Solid-State Circuits, 2005
- High-performance low-power left-to-right array multiplier designIEEE Transactions on Computers, 2005
- A fast and well-structured multiplier2004
- A low-power, high-speed implementation of a PowerPC/sup TM/ microprocessor vector extension2003
- A new parallel technique for design of decrement/increment and two's complement circuits2002
- A radix-8 CMOS S/390 multiplier2002
- High-speed Booth encoded parallel multiplier designIEEE Transactions on Computers, 2000
- Optimal circuits for parallel multipliersIEEE Transactions on Computers, 1998
- A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approachIEEE Transactions on Computers, 1996