This Article 
 Bibliographic References 
 Add to: 
Technology Scaling Effects on Multipliers
November 1998 (vol. 47 no. 11)
pp. 1201-1215

Abstract—Since integrated circuits were invented, fabrication engineers have been able to steadily decrease the dimensions of the devices (transistors). These reductions in the minimum feature sizes have resulted in improved performance. In addition, the dimensions of the interconnect used to connect the active transistors have also scaled. The decreasing dimensions of the physical devices causes the capacitance and resistances of the different parts of the multiplier to change. Therefore, the relative delay due to each part of the multiplier changes. In addition, the different encoding schemes used to generate the partial products and the different topologies used in the reduction of the partial products effect the total latency of the multiplier. This paper examines the effects of the smaller device dimensions on multipliers. It shows that the interconnect is becoming more important and that automatic generation of partial products provides the minimum latency for small feature sizes.

[1] H. Altwaijry and M. Flynn, "Optimum Placement and Routing of Multiplier Partial Product Trees," Technical Report No. CSL-TR-96-706, Computer Systems Laboratory, Stanford Univ., Sept. 1996.
[2] ANSI/IEEE Std. 754-1985, Binary Floating-Point Arithmetic, IEEE Press, Piscataway, N.J., 1985 (also called ISO/IEC 559).
[3] G. Bewick and M.J. Flynn, "Binary Multiplication Using Partially Redundant Multiples," Technical Report No. CSL-TR-92-528, Computer Systems Laboratory, Stanford Univ., June 1992.
[4] A.D. Booth, "A Signed Binary Multiplication Technique," Quarterly J. Mechanics and Applied Mathematics, vol. 4, no. 2, pp. 236-240, 1951.
[5] L. Dadda, "Some Schemes for Parallel Multipliers," Alta Frequenza, vol. 34, pp. 349-356, Mar. 1965
[6] HSPICE Meta-Software, Inc., 1996
[7] G. McFarland and M. Flynn, "Limits of Scaling MOSFETs," Technical Report: CSL-TR-95-662 Revised, Stanford Univ., Nov. 1995.
[8] O.L. McSorley, "High Speed Arithmetic in Binary Computers," Proc. IRE, vol. 49, no. 1, pp. 67-91, Jan. 1961.
[9] Z. Mou and F. Jutand, "A Class of Close to Optimum Adder Trees Allowing Regular and Compact Layout," Proc. 1990 IEEE Int'l Conf. Computer Design: VLSI in Computer Design, pp. 251-254, Sept. 1990.
[10] 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-305, Mar. 1996.
[11] M. Santoro, "Design and Clocking of VLSI Multipliers," PhD thesis, Stanford Univ., Oct. 1989
[12] D.T. Shen and A. Weinberger, "4-2 Carry-Save Adder Implementation Using Send Circuits," IBM Technical Disclosure Bulletin, vol. 20, no. 9, Fe. 1978.
[13] P. Song and G. De Micheli, “Circuit and Architecture Trade-Offs for High-Speed Multiplication,” IEEE J. Solid State Circuits, vol. 26, no. 9, Sept. 1991.
[14] W. Stenzel, W. Kubitz, and G. Garcia, "A Compact High-Speed Multiplication Scheme," IEEE Trans. Computers, vol. 26, no 10, pp. 948-957, Oct. 1977.
[15] M. Suzuki et al. "A 1.5ns 32b CMOS ALU in Double Pass-Transistor Logic," IEEE J. Solid-State Circuits, vol. 28, no. 11, pp. 1,145-1,151, Nov. 1993.
[16] Synopsys Design Compiler version v3.2b, 1995.
[17] N. Takagi,H. Yasuura,, and S. Yajima,“High-speed VLSI multiplication algorithm with a redundant binary addition tree,” IEEE Trans. Computers, vol. 34, no. 9, pp. 789-796, Sept. 1985.
[18] C. S. Wallace, "A Suggestion for a Fast Multiplier," IEEE Trans. Electronic Computers, vol. 13, pp. 14-17, Feb. 1964.
[19] A. Weinberger, "4:2 Carry-Save Adder Module," IBM Technical Disclosure Bulletin, vol. 23, Jan. 1981.
[20] D. Zuras and W.H. McAllister, “Balanced Delay Trees and Combinatorial Division in VLSI,” IEEE J. Solid-State Circuits, vol. 21, pp. 814-819, Oct. 1986.

Index Terms:
Feature size, multipliers, Booth encoding, topology.
Hesham A. Al-Twaijry, Michael J. Flynn, "Technology Scaling Effects on Multipliers," IEEE Transactions on Computers, vol. 47, no. 11, pp. 1201-1215, Nov. 1998, doi:10.1109/12.736430
Usage of this product signifies your acceptance of the Terms of Use.