This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Evaluation of A+B=K Conditions Without Carry Propagation
November 1992 (vol. 41 no. 11)
pp. 1484-1488

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] K. Hwang,Computer Arithmetic: Principles, Architecture, and Design. New York: Wiley, 1979.
[2] R. P. Brent and H. T. Kung, "A regular layout for parallel adders,"IEEE Trans. Comput., vol. C-31, no. 3, pp. 260-264, Mar. 1982.
[3] V. G. Oklobdzija and E. R. Barnes, "Some optimal schemes for ALU implementation in VLSI technology," inProc. 7th Symp. Comput. Arithmetic, June 1985, pp. 2-8.
[4] B. W. Y. Wei and C. D. Thompson, "Area-time optimal adder design,"IEEE Trans. Comput., vol. 39, no. 5, pp. 666-675, May 1990.
[5] M. Pomper, W. Beifuss, K. Horninger, and W. Kaschte, "A 32-bit execution unit in an advanced NMOS technology,"IEEE J. Solid-State Circuits, vol. SC-17, no. 3, pp. 533-538, June 1982.
[6] J. L. Hennessy, "VLSI processor architecture,"IEEE Trans. Comput., vol. C-33, no. 12, pp. 1221-1246, Dec. 1984.
[7] A. Weinberger, "High-speed zero-sum detection," inProc. 4th. Symp. Comput. Arithmetic, Oct. 1978, pp. 200-207.
[8] E. M. Riseman and C. C. Foster, "The inhibition of potential parallelism by conditional jumps,"IEEE Trans. Comput., vol. C-21, no. 12, pp. 1405-1411, Dec. 1972.
[9] S. McFarling and I. Hennessey, "Reducing the cost of branches," inProc. 13th Annu. Symp. Comput. Architecture, June 1986, pp. 396-403.
[10] D. A. Patterson and C. H. Sequin, "RISC I: A reduced instruction set VLSI computer," inProc. 8th Annu. Int. Symp. Comput. Architecture, May 1981, pp. 443-457.
[11] M. G. H. Katevenis,Reduced Instruction Set Computer Architectures for VLSI. Cambridge, MA: M.I.T. Press, 1985.
[12] J. Moussouriset al., "A CMOS RISC processor with integrated system functions," inProc. COMPCON Spring 86, Mar. 1986, pp. 126-131.
[13] Digital Equipment Corp.,VAX-11 Architecture Handbook, 1981.
[14] Motorola Inc.,MC68030 Enhanced 32-Bit Microprocessor User's Manual, Austin, TX, Motorola, 1987.

Index Terms:
response time; parallel adders; carry propagation delay; performance; adders; digital arithmetic.
Citation:
J. Cortadella, J.M. Llaberia, "Evaluation of A+B=K Conditions Without Carry Propagation," IEEE Transactions on Computers, vol. 41, no. 11, pp. 1484-1488, Nov. 1992, doi:10.1109/12.177318
Usage of this product signifies your acceptance of the Terms of Use.