TY - JOUR
T1 - High-Speed Area-Efficient Multiplier Design Using Multiple-Valued Current-Mode Circuits
AU - Kawahito, Shoji
AU - Ishida, Makoto
AU - Nakamura, Tetsuro
AU - Kameyama, Michitaka
AU - Higuchi, Tatsuo
N1 - Funding Information:
Manuscript received October 21, 1991; revised April 2,1992, and July 20, 1992. This work was supported in part by a Grant-in-Aid for Young Scientists 03750350 from the Ministry of Education, Science and Culture of Japan. S. Kawahito is with the Department of Information and Computer Sciences, Toyohashi University of Technology, Toyohashi 441, Japan. M. Ishida and T. Nakamura are with the Department of Electrical and Electronic Engineering, Toyohashi University of Technology, Toyohashi 441, Japan. M. Kameyama and T. Higuchi are with the Department of System Information Sciences, Graduate School of Information Sciences, Tohoku University, Sendai 980, Japan. IEEE Log Number 9208773.
PY - 1994/1
Y1 - 1994/1
N2 - This paper presents a very-Iarge-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 {0,1, 2, 3} and {0, 1, 2. 3, 4}. 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 {0, 1, 2, 3} 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.
AB - This paper presents a very-Iarge-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 {0,1, 2, 3} and {0, 1, 2. 3, 4}. 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 {0, 1, 2, 3} 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.
KW - Area-efficient design
KW - VLSI
KW - carry-propagation-free ad-
KW - dition
KW - high-speed multiplier
KW - multiple-valued current-mode circuits
KW - redundant number representations
KW - tree structure
UR - http://www.scopus.com/inward/record.url?scp=0028201140&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0028201140&partnerID=8YFLogxK
U2 - 10.1109/12.250607
DO - 10.1109/12.250607
M3 - Article
AN - SCOPUS:0028201140
VL - 43
SP - 34
EP - 42
JO - IEEE Transactions on Computers
JF - IEEE Transactions on Computers
SN - 0018-9340
IS - 1
ER -