High-performance left-to-right array multiplier design

We propose a split array multiplier organized in a left-to-right leapfrog (LRLF) structure with reduced delay compared to conventional array multipliers. Moreover, the proposed design shows equivalent performance as tree multipliers for n/spl les/32. An efficient radix-4 recoding logic generates the partial products in a left-to-right order. The partial products are split into upper and lower groups. Each group is reduced using [3:2] adders with optimized signal flows and the carry-save results from two groups are combined using a [4:2] adder. The final product is obtained with a prefix adder optimized to match the non-uniform arrival profile of the inputs. Layout experiments indicate that upper/lower split multipliers have slightly less area and power than optimized tree multipliers while keeping the same delay for n/spl les/32.

[1]  G. Goto,et al.  A 54*54-b regularly structured tree multiplier , 1992 .

[2]  Milos D. Ercegovac,et al.  Low power array multiplier design by topology optimization , 2002, SPIE Optics + Photonics.

[3]  J. Kim,et al.  Improving the recursive multiplier , 2000, Conference Record of the Thirty-Fourth Asilomar Conference on Signals, Systems and Computers (Cat. No.00CH37154).

[4]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[5]  Earl E. Swartzlander,et al.  Analysis of column compression multipliers , 2001, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001.

[6]  Luigi Ciminiera,et al.  Carry-Save Multiplication Schemes without Final Addition , 1996, IEEE Trans. Computers.

[7]  Michael Schulte,et al.  Design and implementation of a 16 by 16 low-power two's complement multiplier , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[8]  Poras T. Balsara,et al.  High performance low power array multiplier using temporal tiling , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[9]  Israel Koren.  Computer arithmetic algorithms , 1993 .

[10]  Chein-Wei Jen,et al.  High-Speed Booth Encoded Parallel Multiplier Design , 2000, IEEE Trans. Computers.

[11]  T. Noguchi,et al.  A 15-ns 32*32-b CMOS multiplier with an improved parallel structure , 1990 .

[12]  Hosahalli R. Srinivas,et al.  VLSI implementation of a 200-MHz 16/spl times/16 left-to-right carry-free multiplier in 0.35 /spl mu/m CMOS technology for next-generation DSPs , 1997, Proceedings of CICC 97 - Custom Integrated Circuits Conference.

[13]  Alan N. Willson,et al.  A painless way to reduce power dissipation by over 18% in Booth-encoded carry-save array multipliers for DSP , 2000, 2000 IEEE Workshop on SiGNAL PROCESSING SYSTEMS. SiPS 2000. Design and Implementation (Cat. No.00TH8528).

[14]  H. Makino,et al.  A 600-MHz 54/spl times/54-bit multiplier with rectangular-styled Wallace tree , 2001 .

[15]  Reto Zimmermann,et al.  Binary adder architectures for cell-based VLSI and their synthesis , 1997 .

[16]  Vojin G. Oklobdzija,et al.  A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach , 1996, IEEE Trans. Computers.

[17]  Earl E. Swartzlander,et al.  Design of a hybrid prefix adder for nonuniform input arrival times , 2002, SPIE Optics + Photonics.

[18]  Tomás Lang,et al.  Fast Multiplication Without Carry-Propagate Addition , 1990, IEEE Trans. Computers.

[19]  Jun Iwamura,et al.  A high speed and low power CMOS/SOS multiplier-accumulator , 1983 .