Evaluation of A + B = K Conditions Without Carry Propagation

The response time of parallel adders is mainly determined by the carry propagation delay. The evaluation of conditions of the type A+B=K is addressed. Although an addition is involved in the comparison, it is shown that it can be evaluated without carry propagation, thus drastically reducing the computation time. Dependencies produced by branches degrade the performance of pipelined computers. The evaluation of conditions is often one of the critical paths in the execution of branch instructions. A circuit is proposed for the fast evaluation of A+B=K conditions that can significantly improve processor performance. >

[1]  Arnold Weinberger.  High-speed zero-sum detection , 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

[2]  H. T. Kung,et al.  A Regular Layout for Parallel Adders , 1982, IEEE Transactions on Computers.

[3]  Chris Rowen,et al.  A CMOS RISC Processor with Integrated System Functions , 1986, COMPCON.

[4]  Vojin G. Oklobdzija,et al.  Some optimal schemes for ALU implementation in VLSI technology , 1985, 1985 IEEE 7th Symposium on Computer Arithmetic (ARITH).

[5]  Edward M. Riseman,et al.  The Inhibition of Potential Parallelism by Conditional Jumps , 1972, IEEE Transactions on Computers.

[6]  K. Horninger,et al.  A 32-bit execution unit in an advanced NMOS technology , 1982, IEEE Journal of Solid-State Circuits.

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

[8]  JOHN L. HENNESSY,et al.  VLSI Processor Architecture , 1984, IEEE Transactions on Computers.

[9]  Emmanuel Katevenis,et al.  Reduced instruction set computer architectures for VLSI , 1984 .

[10]  S. McFarling,et al.  Reducing the cost of branches , 1986, ISCA '86.

[11]  Belle W. Y. Wei,et al.  Area-Time Optimal Adder Design , 1990, IEEE Trans. Computers.