This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Design Technique for Column Compression Multipliers
August 1995 (vol. 44 no. 8)
pp. 962-970

Abstract—In this paper, a new design technique for column-compression (CC) multipliers is presented. Constraints for column compression with full and half adders are analyzed and, under these constraints, considerable flexibility for implementation of the CC multiplier, including the allocation of adders, and choosing the length of the final fast adder, is exploited. Using the example of an 8 × 8 bit CC multiplier, we show that architectures obtained from this new design technique are more area efficient, and have shorter interconnections than the classical Dadda CC multiplier. We finally show that our new technique is also suitable for the design of twos complement multipliers.

[1] A. Habibi and P.A. Windy,“Fast multiplier,” IEEE Trans. Computers, vol. 19, pp. 153-157, 1970.
[2] J.Y. Lee et al., "A High-Speed High-Density Silicon 8X8-bit Parallel Multiplier," IEEE J. Solid State Circuits, vol. 22, no. 1, Feb. 1987.
[3] S. Nakamura, "Algorithm for Iterative Array Multiplication," IEEE Trans. Computers, vol. 35, no. 8, pp. 713-719, Aug. 1986.
[4] S. Nakamura and K.-Y. Chu, "A Single Chip Parallel Multiplier by MOS Technology," IEEE Trans. Computers, vol. 37, no. 3, pp. 274-282, Mar. 1988.
[5] B. Maden and C.G. Guy,“Parallel architectures for high speed multipliers,” Proc. ISCAS’89, pp. 142-145, 1989.
[6] Z. Wang,G.A. Jullien,, and M. C. Miller,“An architecture for parallel multipliers,” 25th Asilomar Conf. Signal, System, and Computers, Nov. 1991,Pacific Grove, Calif.
[7] Y. Ofman,“On the complexity of discrete functions,” Soviet Physics-Doklady, vol. 7, pp. 589-591, 1963.
[8] C.S. Wallace,“A suggestion for a fast multiplier,” IEEE Trans. Electronic Computers, vol. 13, pp. 14-17, 1964.
[9] L. Dadda,“Some schemes for parallel multipliers,” Acta Frequenza, vol. 45, pp. 574-580, 1966.
[10] P.R. Capello and K. Steiglitz, "A VLSI Layout for a Pipeline Dadda Multiplier," ACM Trans. Computer Design, vol. 1, no. 2, pp. 157-174, May 1983.
[11] D.G. Crawley and G.A.J. Amaratunga,“8×8 bit pipelined Dadda multiplier in CMOS,” IEEE Proc., vol. 135, pp. 231-240, 1988.
[12] M.T. Santoro and M.A. Horoeitz,“SPIM: A pipelined 64×64 bit iterative multiplier,” IEEE J. Solid-State Circuits, vol. 24, pp. 487-494, 1989.
[13] N. Nagamatsu,S. Tanak,J. Mori,K. Hirano,T. Nogushi,, and K. Hatanaka,“A 15-ns 32×32 bit CMOS multiplier with an improved parallelstructure,” IEEE J. Solid-State Circuits, vol. 25, pp. 494-497, 1990
[14] M. Mehta,V. Parmmar,, and E. Swartzlander Jr,“High-speed multiplier design using multi-input counter and compressorcircuits,” 1991 IEEE Conf. on Computer Arithmetic.
[15] C.R. Bouch and B.A. Wooley,“A twos complement parallel array multiplication algorithm,” IEEE Trans. Computers, vol. 22, pp. 1,045-1,047, 1973.
[16] P.E. Blankenship, “Comments on’A twos complement parallel array multiplication algorithm,’” IEEE Trans. Computers, vol. 23, p. 1,327, 1974.

Index Terms:
Multipliers, column compression techniques, Dadda multiplier, twos complement multiplier.
Citation:
Graham A. Jullien, Zhongde Wang, William C. Miller, "A New Design Technique for Column Compression Multipliers," IEEE Transactions on Computers, vol. 44, no. 8, pp. 962-970, Aug. 1995, doi:10.1109/12.403712
Usage of this product signifies your acceptance of the Terms of Use.