High-Speed Area-Efficient Multiplier Design Using Multiple-Valued Current-Mode Circuits

Presents a very-large-scale-integration (VLSI)-oriented high-speed multiplier design method based on carry-propagation-free addition trees and a circuit technique, so-called multiple-valued current-mode (MVCM) circuits. The carry-propagation-free addition method uses a redundant digit set such as /spl lcub/0,1,2,3/spl rcub/ and /spl lcub/0,1,2,3,4/spl rcub/. The number representations using such redundant digit sets are called redundant positive-digit number representations. The carry-propagation-free addition is written by three steps, and the adder can be designed directly and efficiently from the algorithm using MVCM circuits. The designed multiplier internally using the MVCM parallel adder with the digit set /spl lcub/0,1,2,3/spl rcub/ in radix 2 has attractive features on speed, regularity of the structure, and reduced complexities of active elements and interconnections. A prototype CMOS integrated circuit of the MVCM parallel adder has been implemented, and its stable operation has been confirmed. Other possible schemes of multipliers with redundant digit sets using MVCM technology are discussed. >

[1]  Shoji Kawahito,et al.  A multiplier chip with multiple-valued bidirectional current-mode logic circuits , 1988, Computer.

[2]  Stephen H. Unger.  Tree Realizations of Iterative Circuits , 1977, IEEE Transactions on Computers.

[3]  Jean Vuillemin,et al.  A very fast multiplication algorithm for VLSI implementation , 1983, Integr..

[4]  Hiroto Yasuura,et al.  High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985, IEEE Transactions on Computers.

[5]  M. Mehta,et al.  High-speed multiplier design using multi-input counter and compressor circuits , 1991, [1991] Proceedings 10th IEEE Symposium on Computer Arithmetic.

[6]  Louis P. Rubinfield.  A Proof of the Modified Booth's Algorithm for Multiplication , 1975, IEEE Transactions on Computers.

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

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

[9]  Shoji Kawahito,et al.  Multiple-valued current-mode arithmetic circuits based on redundant positive-digit number representations , 1991, [1991] Proceedings of the Twenty-First International Symposium on Multiple-Valued Logic.

[10]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[11]  Earl E. Swartzlander.  Parallel Counters , 1973, IEEE Transactions on Computers.

[12]  Michitaka Kameyama,et al.  Multiple-valued radix-2 signed-digit arithmetic circuits for high-performance VLSI systems , 1990 .

[13]  Michitaka Kameyama,et al.  A 32 × 32 BIT multiplier using multiple-valued MOS current-mode circuits , 1987, 1987 Symposium on VLSI Circuits.

[14]  E. Hokenek,et al.  An 18 ns 56-bit multiply-adder circuit , 1990, 1990 37th IEEE International Conference on Solid-State Circuits.

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

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

[17]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .