A novel Josephson adder without carry propagation delay

The authors describe a novel Josephson adder based on the radix-2 signed-digit number representation. In the proposed adder, the addition operation can be carried out in a constant time independent of word length owing to the elimination of the carry propagation chain. A critical path for generating the sum signal can be completed through only three series gates. A carry signal and an intermediate sum signal for all digits in the adder are simultaneously generated in the first step, and the final sum signal is obtained in the second step. Features of the proposed adder are a simple construction, ultra-high speed, and low power consumption. The principle of constructing the adder with an 8 b word length using superconducting quantum interference devices (SQUIDs) is described in detail, and simulation results are presented. Results show that reliable operation can be achieved for the longest delay time of 120 ps for the 8 b adder.<<ETX>>

[1]  Mititada Morisue,et al.  A superconducting ternary systolic array processor , 1992, [1992] Proceedings The Twenty-Second International Symposium on Multiple-Valued Logic.

[2]  Hiroshi Nakagawa,et al.  A multichip superconducting microcomputer ETL-JC1 , 1991 .

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

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

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

[6]  M. Morisue,et al.  JCTL: a Josephson complementary ternary logic circuit , 1988, [1988] Proceedings. The Eighteenth International Symposium on Multiple-Valued Logic.