Technology scaling effects on multipliers

IEEE Transactions on Computers

Volumn 47, Issue 11, 1998, Pages 1201-1215

  Al Twaijry, Hesham A ^b   Flynn, Michael J ^a,b  

^a IEEE   (United States)

^b STANFORD UNIVERSITY   (United States)

Author keywords

Booth encoding; Feature size; Multipliers; Topology

Indexed keywords

INTERCONNECTION NETWORKS; OPTIMIZATION; PERFORMANCE; SIGNAL ENCODING; TOPOLOGY; TRANSISTORS;

SCALING EFFECTS;

MULTIPLYING CIRCUITS;

EID: 0032203943     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.736430     Document Type: Article

References (20)

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, IEEE Standard for Binary Floating-point Arithmetic, 1985.
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-306, 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 Tradeoffs for High-Speed Multiplication," IEEE J. Solid-State Circuits, vol. 26, no. 9, pp. 1,184-1,198, 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 CMOSALU 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 Multilication Algorithm with a Redundant Binary Addition Tree," IEEE Trans. Computers, vol. 34, no. 9, 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. McAllister, "Balanced Delay Trees and Combinatorial Division in VLSI," IEEE J. Solid-State Circuits, vol. 21, no. 5, pp. 814-819, Oct. 1986