A Method for Speed Optimized Partial Product Reduction and Generation of Fast Parallel Multipliers Using an Algorithmic Approach

This paper presents a method and an algorithm for generation of a parallel multiplier, which is optimized for speed. This method is applicable to any multiplier size and adaptable to any technology for which speed parameters are known. Most importantly, it is easy to incorporate this method in silicon compilation or logic synthesis tools. The parallel multiplier produced by the proposed method outperforms other schemes used for comparison in our experiment. It uses the minimal number of cells in the partial product reduction tree. These findings are tested on design examples simulated in 1 /spl mu/ CMOS ASIC technology.

[1]  Robert K. Brayton,et al.  Timing optimization of combinational logic , 1988, [1988] IEEE International Conference on Computer-Aided Design (ICCAD-89) Digest of Technical Papers.

[2]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[3]  Vojin G. Oklobdzija,et al.  Evaluation of Booth encoding techniques for parallel multiplier implementation , 1993 .

[4]  Vojin G. Oklobdzija,et al.  Multiplier design utilizing improved column compression tree and optimized final adder in CMOS technology , 1993, 1993 International Symposium on VLSI Technology, Systems, and Applications Proceedings of Technical Papers.

[5]  G. De Micheli,et al.  Circuit and architecture trade-offs for high-speed multiplication , 1991 .

[6]  C. W. Slayman,et al.  A high-speed high-density silicon 8/spl times/8-bit parallel multiplier , 1987 .

[7]  Jalil Fadavi-Ardekani.  M×N Booth encoded multiplier generator using optimized Wallace trees , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[8]  Orest J. Bedrij.  Carry-Select Adder , 1962, IRE Trans. Electron. Comput..

[9]  M. Horowitz,et al.  A Pipelined 64x64b Iterative Array Multiplier , 1988, 1988 IEEE International Solid-State Circuits Conference, 1988 ISSCC. Digest of Technical Papers.

[10]  Robert K. Brayton,et al.  Delay optimization of combinational logic circuits by clustering and partial collapsing , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[11]  Raymond S. Lim.  High-speed multiplication and multiple summand addition , 1978, 1978 IEEE 4th Symposium onomputer Arithmetic (ARITH).

[12]  Vojin G. Oklobdzija,et al.  An ASIC macro cell multiplier for complex numbers , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[13]  Vojin G. Oklobdzija.  Design and analysis of fast carry-propagate adder under non-equal input signal arrival profile , 1994, Proceedings of 1994 28th Asilomar Conference on Signals, Systems and Computers.

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

[15]  R. Ravi,et al.  Design strategies for optimal multiplier circuits , 1995, Proceedings of the 12th Symposium on Computer Arithmetic.

[16]  Vojin G. Oklobdzija,et al.  Improved CLA scheme with optimized delay , 1991, J. VLSI Signal Process..

[17]  Mark R Santoro.  Design and Clocking of VLSI Multipliers , 1989 .

[18]  M. L. Bos.  A simple, high-precision, high speed digital frequency multiplier , 1997, Proceedings of 40th Midwest Symposium on Circuits and Systems. Dedicated to the Memory of Professor Mac Van Valkenburg.

[19]  P. H. Ang,et al.  Generation of high speed CMOS multiplier-accumulators , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[20]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[21]  William J. Kubitz,et al.  A Compact High-Speed Parallel Multiplication Scheme , 1977, IEEE Transactions on Computers.

[22]  Mark Horowitz,et al.  SPIM: a pipelined 64*64-bit iterative multiplier , 1989 .

[23]  Earl E. Swartzlander,et al.  Computer Arithmetic , 1980 .

[24]  Stylianos D. Pezaris.  A 40-ns 17-Bit by 17-Bit Array Multiplier , 1971, IEEE Transactions on Computers.

[25]  O. L. Macsorley.  High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.

[26]  Christopher S. Wallace,et al.  A Suggestion for a Fast Multiplier , 1964, IEEE Trans. Electron. Comput..

[27]  Vojin G. Oklobdzija,et al.  On Implementing Addition in VLSI Technology , 1988, J. Parallel Distributed Comput..

[28]  W. C. Miller,et al.  Column Compression Multipliers For Signal Processing Applications , 1992, Workshop on VLSI Signal Processing.

[29]  M. Nagamatsu,et al.  A 10 ns 54*54 b parallel structured full array multiplier with 0.5 mu m CMOS technology , 1991 .