The design of an asynchronous carry-lookahead adder based on data characteristics

Authors:
Yijun Liu;Steve Furber
Affiliations:
APT Group, School of Computer Science, University of Manchester, Manchester, UK;APT Group, School of Computer Science, University of Manchester, Manchester, UK
Venue:
PATMOS'05 Proceedings of the 15th international conference on Integrated Circuit and System Design: power and Timing Modeling, Optimization and Simulation
Year:
2005

Citing 4
Cited 0

Computer architecture: a quantitative approach

Computer architecture: a quantitative approach
A CMOS VLSI Implementation of an Asynchronous ALU

Proceedings of the IFIP WG10.5 Working Conference on Asynchronous Design Methodologies
A Low-power Asynchronous Data-path for a FIR Filter Bank

ASYNC '96 Proceedings of the 2nd International Symposium on Advanced Research in Asynchronous Circuits and Systems
Principles of Asynchronous Circuit Design: A Systems Perspective

Principles of Asynchronous Circuit Design: A Systems Perspective

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.