This Article 
 Bibliographic References 
 Add to: 
High-Performance Low-Power Left-to-Right Array Multiplier Design
March 2005 (vol. 54 no. 3)
pp. 272-283
We present a high-performance low-power design of linear array multipliers based on a combination of the following techniques: signal flow optimization in [3:2] adder array for partial product reduction, left-to-right leapfrog (LRLF) signal flow, and splitting of the reduction array into upper/lower parts. The resulting upper/lower LRLF (ULLRLF) multiplier is compared with tree multipliers. From automatic layout experiments, we find that ULLRLF multipliers have similar power, delay, and area as tree multipliers for n \leq 32. With more regularity and inherently shorter interconnects, the ULLRLF structure presents a competitive alternative to tree structures in the design of fast low-power multipliers implemented in deep submicron VLSI technology.

[1] K.C. Bickerstaff, E.E. Swartzlander Jr., and M.J. Schulte, “Analysis of Column Compression Multipliers,” Proc. 15th IEEE Symp. Computer Arithmetic, pp. 33-29, 2001.
[2] B. Chen and I. Nedelchev, “Power Compiler: A Gate-Level Power Optimization and Synthesis System,” Proc. 1997 IEEE Int'l Conf. Computer Design, pp. 74-79, Oct. 1997.
[3] L. Ciminiera and P. Montuschi, “Carry-Save Multiplication Schemes without Final Addition,” IEEE Trans. Computers, vol. 45, no. 9, pp. 1050-1055, Sept. 1996.
[4] A.N. Danysh and E.E. Swartzlander Jr., “A Recursive Fast Multiplier,” Proc. 32th Asilomar Conf. Signals, Systems, and Computers, pp. 197-201, Nov. 1998.
[5] M.D. Ercegovac and T. Lang, “Fast Multiplication without Carry-Propagate Addition,” IEEE Trans. Computers, vol. 39, no. 11, pp. 1385-1390, Nov. 1990.
[6] M.D. Ercegovac and T. Lang, Digital Arithmetic. Morgan Kaufmann Publishers, Elsevier Science Ltd., 2004.
[7] A. Goldovsky et al., “Design and Implementation of a 16 By 16 Low-Power Two's Complement Multiplier,” Proc. 2000 IEEE Int'l Symp. Circuits and Systems, vol. 5, pp. 345-348, 2000.
[8] G. Goto et al., “A 54*54-b Regularly Structured Tree Multiplier,” IEEE J. Solid-State Circuits, vol. 27, no. 9, pp. 1229-1236, Sept. 1992.
[9] Z. Huang, “High-Level Optimization Techniques for Low-Power Multiplier Design,” PhD dissertation, Univ. of California, Los Angeles, June 2003.
[10] N. Itoh et al., “A 600-MHz 54*54-Bit Multiplier with Rectangular-Styled Wallace Tree,” IEEE J. Solid-State Circuits, vol. 36, no. 2, pp. 249-257, Feb. 2001.
[11] J. Iwamura et al., “A High Speed and Low Power CMOS/SOS Multiplier-Accumulator,” Microelectronics J., vol. 14, no. 6, pp. 49-57, Nov.-Dec. 1983.
[12] C. Lee, M. Potkonjak, and W.H. Mangione-Smith, “MediaBench: A Tool for Evaluating and Synthesizing Multimedia and Communications Systems,” Proc. 30th Ann. IEEE/ACM Int'l Symp. Microarchitecture, pp. 330-335, Dec. 1997.
[13] S.S. Mahant-Shetti, P.T. Balsara, and C. Lemonds, “High Performance Low Power Array Multiplier Using Temporal Tiling,” IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 7, no. 1, pp. 121-124, Mar. 1999.
[14] K. Muhammad, D. Somasekhar, and K. Roy, “Switching Characteristics of Generalized Array Multiplier Architectures and Their Applications to Low Power Design,” Proc. 1999 IEEE Int'l Conf. Computer Design, pp. 230-235, Oct. 1999.
[15] M. Nagamatsu et al., “A 15-ns 32*32-b CMOS Multiplier with an Improved Parallel Structure,” IEEE J. Solid-State Circuits, vol. 25, pp. 494-497, Apr. 1990.
[16] F. Najm, “A Survey of Power Estimation Techniques in VLSI Circuits,” IEEE Trans. Very Large Scale Integration (VLSI) Systems, vol. 2, no. 4, pp. 446-455, Dec. 1994.
[17] 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 Trans. Computers, vol. 45, no. 3, pp. 294-306, Mar. 1996.
[18] C.-H. Park et al., “Asynchronous Array Multiplier with an Asymmetric Parallel Array Structure,” Proc. 2001 Conf. Advanced Research in VLSI, pp. 202-212, Mar. 2001.
[19] T. Sakuta, W. Lee, and P.T. Balsara, “Delay Balanced Multipliers for Low Power/Low Voltage DSP Core,” Proc. 1995 IEEE Symp. Low Power Electronics, pp. 36-37, Oct. 1995.
[20] P.F. Stelling et al., “Optimal Circuits for Parallel Multipliers,” IEEE Trans. Computers, vol. 47, no. 3, pp. 273-285, Mar. 1998.
[21] T.T. Ye et al., “Physical Synthesis for ASIC Datapath Circuits,” Proc. 2002 IEEE Int'l Symp. Circuits and Systems, pp. 365-368, 2002.
[22] J.D. Ullman, Computational Aspects of VLSI. Computer Science Press, 1983.
[23] G.K. Yeap, Practical Low Power Digital VLSI Design. Kluwer Academic, 1998.
[24] W.-C. Yeh and C.-W. Jen, “High-Speed Booth Encoded Parallel Multiplier Design,” IEEE Trans. Computers, vol. 49, no. 7, pp. 692-701, July 2000.
[25] Z. Yu, L. Wasserman, and A.N. Willson Jr., “A Painless Way to Reduce Power Dissipation by over 18% in Booth-Encoded Carry-Save Array Multipliers for DSP,” Proc. 2000 IEEE Workshop Signal Processing Systems, pp. 571-580, Oct. 2000.
[26] International Technology Roadmap for Semiconductors— Interconnect. 2001.

Index Terms:
Left-to-right array multiplier, tree multiplier, high-performance design, low-power design, layout regularity.
Zhijun Huang, Milo? D. Ercegovac, "High-Performance Low-Power Left-to-Right Array Multiplier Design," IEEE Transactions on Computers, vol. 54, no. 3, pp. 272-283, March 2005, doi:10.1109/TC.2005.51
Usage of this product signifies your acceptance of the Terms of Use.