Completion-detecting carry select addition

IEE Proceedings: Computers and Digital Techniques

Volumn 147, Issue 2, 2000, Pages 93-100

  De Gloria, A ^a   Olivieri, M ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CARRY SELECT (CS) LOGICS; SELF-TIMED ADDERS; SOFTWARE PACKAGE SPICE;

CMOS INTEGRATED CIRCUITS; COMPUTER SIMULATION; INTEGRATED CIRCUIT LAYOUT; OPTIMIZATION; RESPONSE TIME (COMPUTER SYSTEMS);

ADDERS;

EID: 0033721951     PISSN: 13502387     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-cdt:20000451     Document Type: Article

References (19)

1. IEEE Design and Test of Computers, special issue on asynchronous circuit and systems, 11, (2), Summer, 1994
2. Proceedings of the 4th international symposium on Advanced research in asynchronous circuits and systems, (IEEE Computer Society Press, San Diego, CA, 1998)
3. SEITZ, C.L.: 'System Timing' in MEAD, C. and CONWAY, L. (Eds.) 'Introduction to VLSI systems design' (Addison Wesley, 1980), pp. 218-262
4. AFGAHI, M., and SVENSSON, C.: 'Performance of synchronous and asynchronous design scheme for VLSI systems' IEEE Trans., 1992, C41, (7), pp. 838-872
5. SKALNSKY, J.: 'An evaluation of several two-summand binary adders' IRE Trans., 1960, EC-9, pp. 213-226
6. JOHNSON, D., and AKELLA, V: 'Design and analysis of asynchronous adders' IEE Proc., Comput. Digit. Tech., 1998, 145, (1)
7. KINNEMENT, D.J.: 'An evaluation of asynchronous addition' IEEE Trans. VLSI Syst., 1996, 4, (1), pp. 137-140
8. BRILEY, B.: 'Some new results on average worst case carry' IEEE Trans., 1973, C-22, pp. 459-463
9. BURK.S, A.W., GOLDSTINE, H., and VON NEUMANN, J.: 'Preliminary discussion on the logical design of an electronic computing instrument' Technical report, Institute of Advanced Study, Princeton, NJ, 1947
10. REITWIESNER, G.W.: 'The determination of carry propagation length for binary addition' IRE Trans., 1960, EC-9, pp. 35-38
11. MACSORLEY, O.L.: 'High speed arithmetic in binary computers' IRE Proc., 1961,49, pp. 67-91
12. BEDRIJ, O.J.: 'Carry select adder' IRETrans., 1962, EC-11, pp. 340346
13. LEHMAN, M., and BURLA, N.: 'Skip techniques for high speed carry propagation in binary arithmetic units' IRE Trans., 1961, EC-10, pp 691-698
14. BRENT, R.P., and RUNG, H.T.: 'A regular layout for parallel adders' IEEE Trans., 1982, C-31, pp. 260-264
15. HENNESSY, J.L., and PATTERSON, D.A.: 'Computer architecture: A Quantitative approach' (Morgan Kaufmann, Palo Alto, CA, 1990)
16. LYNCH, T., and SWARTZLANDER, E.E.: 'A spanning tree carry lookahead adder' IEEE Trans., 1992, C-41, (8), pp. 931-939
17. DEGLORIA, A., and OLIVIERI, M.: 'Statistical carry lookahead adders' IEEE Trans., 1996, C-45, (3), pp. 340-347
18. OLIVIERI, M.: 'Analytic model of the average addition time of carry select addition' Technical report, Univ. of Rome 1, Italy. Available at ftp://ssl.ing.uniromal.it/pub/reports/olivicri2.pdf
19. WESTE, N.H., and ESHRAGHIAN, K.: 'Principles of CMOS VLSI design' (Addison Wesley, 1993)