An efficient redundant-binary number to binary number converter

The authors present a method for converting the redundant-binary representation into the 2's complement binary representation. Instead of using the conventional full adders, a more efficient redundant-binary number to binary number converter can be designed with the aid of the new variable C/sub i/. The method can be applied to both 'serial' and 'lookahead' modes. In both modes, it was shown that the authors' converter takes less chip area and conversion time when compared with the conventional method. >

[1]  Naofumi Takagi,et al.  Design of high speed MOS multiplier and divider using redundant binary representation , 1987, 1987 IEEE 8th Symposium on Computer Arithmetic (ARITH).

[2]  Hironori Yamauchi,et al.  A 50-MHz CMOS geometrical mapping processor , 1989 .

[3]  Masakazu Yamashina,et al.  200 MHz 16-bit BiCMOS signal processor , 1989, IEEE International Solid-State Circuits Conference, 1989 ISSCC. Digest of Technical Papers.

[4]  N. Takagi,et al.  A high-speed multiplier using a redundant binary adder tree , 1987 .

[5]  Paul Jespers,et al.  A new carry-free division algorithm and its application to a single-chip 1024-b RSA processor , 1989 .

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

[7]  H. Yoshimura,et al.  A 50mhz Cmos Geometrical Mapping Processor , 1988, 1988 IEEE International Solid-State Circuits Conference, 1988 ISSCC. Digest of Technical Papers.

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