The Design of an Asynchronous Carry-Lookahead Adder Based on Data Characteristics
Addition is the most important operation in data processing and its speed has a significant impact on the overall performance of digital circuits. Therefore, many techniques have been proposed for fast adder design. An asynchronous ripple-carry adder is claimed to use a simple circuit implementation to gain a fast average performance as long as the worst cases input patterns rarely happen. However, based on the input vectors from a number of benchmarks, we observe that the worst cases are not exceptional but commonly exist. A simple carry-lookahead scheme is proposed in the paper to speed up the worst-case delay of a ripple-carry adder. The experiment result shows the proposed adder is about 25% faster than an asynchronous ripple-carry adder with only small area and power overheads.
Unable to display preview. Download preview PDF.
- 1.Goldberg, D.: Computer arithmetic. In: Computer Architecture: A Quantitative Approach, Morgan Kaufmann Publishers, San Francisco (1990)Google Scholar
- 4.Tuttini, S.: Optimal group distribution in carry-skip adders. In: Proceedings of the 9th Symposium on Computer Arithmetic, September 1989, pp. 96–103 (1989)Google Scholar
- 6.Garside, J.D.: A CMOS VLSI Implementation of an Asynchronous ALU. In: Proceedings of the IFIP Working Conference on Asynchronous Design Methodologies, Manchester, England (1993)Google Scholar
- 7.Nielsen, L.S., Sparsø, J.: A low-power asynchronous data-path of a FIR filter bank. In: Proceeding of Asyn 1996, pp. 197–207 (1996)Google Scholar
- 8.Sparsø, J., Furber, S. (eds.): Principles of Asynchronous Circuit Design: A systems perspective. Kluwer Academic Publishers, Dordrecht (2001)Google Scholar