A new architecture for signed radix-2/sup m/ pure array multipliers
Authors:
- S. BampiSBS. Bampi
- J. MonteiroJMJ. Monteiro
- 26 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10636404,p. 112-117
Abstract
We present a new architecture for signed multiplication which maintains the pure form of an array multiplier, exhibiting a much lower overhead than the Booth architecture. This architecture is extended for radix-2/sup m/ encoding, which leads to a reduction of the number of partial lines, enabling a significant improvement in performance and power consumption. The flexibility of our architecture allows for the easy construction of multipliers for different values of m, as opposed to the Booth architecture for which implementations for m > 2 are complex. The results we present show that the proposed architecture with radix-4 compares favorably in performance and power with the Modified Booth multiplier. We have experimented our architecture with different values of m and concluded that m = 4 minimizes both delay and power.Keywords
This publication has 9 references indexed in Scilit:
- Optimizing multipliers for WSI2002
- High radix booth multipliers using reduced area adder trees2002
- Binary multiplication radix-32 and radix-2562002
- Design and implementation of a 16 by 16 low-power two's complement multiplier2002
- Multiplexer-based array multipliersIEEE Transactions on Computers, 1999
- A 4.1-ns compact 54×54-b multiplier utilizing sign-select Booth encodersIEEE Journal of Solid-State Circuits, 1997
- Circuit techniques for CMOS low-power high-performance multipliersIEEE Journal of Solid-State Circuits, 1996
- A 3.8-ns CMOS 16*16-b multiplier using complementary pass-transistor logicIEEE Journal of Solid-State Circuits, 1990
- A Suggestion for a Fast MultiplierIEEE Transactions on Electronic Computers, 1964