Multiple-valued current-mode arithmetic circuits based on redundant positive-digit number representations
- 10 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
High-speed arithmetic algorithms and circuits based on redundant positive-digit number representations are described. To perform two-input radix-2 addition, for example, the proposed algorithm uses digit set (0, 1, 2, 3). The addition and subtraction can be performed speedily by a constant time independent of the wordlength. The n-digit multiplication and division can he performed in a time proportional to log/sub 2/ n and n, respectively. The basic arithmetic circuits are designed and implemented with multiple-valued current-mode circuits. The multiple-valued arithmetic circuits using the proposed algorithms exhibit good speed and compactness in VLSI implementation.<>Keywords
This publication has 7 references indexed in Scilit:
- Multiple-valued radix-2 signed-digit arithmetic circuits for high-performance VLSI systemsIEEE Journal of Solid-State Circuits, 1990
- A multiplier chip with multiple-valued bidirectional current-mode logic circuitsComputer, 1988
- A 32*32-bit multiplier using multiple-valued MOS current-mode circuitsIEEE Journal of Solid-State Circuits, 1988
- A 33 Mflops Floating Point Processor Using Redundant Binary RepresentationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1988
- A very fast multiplication algorithm for VLSI implementationIntegration, 1983
- Signed-Digit Numbe Representations for Fast Parallel ArithmeticIEEE Transactions on Electronic Computers, 1961
- A New Class of Digital Division MethodsIRE Transactions on Electronic Computers, 1958