Variable latency speculative addition
Ajay Kumar Verma, Philip Brisk, Paolo Ienne · Design, Automation and Test in Europe Conference (DATE) · 2008
Adders are one of the key components in arithmetic circuits. Enhancing their performance can significantly improve the quality of arithmetic designs. This is the reason why the theoretical lower bounds on the delay and area of an adder have been analysed, and circuits with performance close to these bounds have been designed. In this paper, we present a novel adder design that is exponentially faster than traditional adders; however, it produces incorrect results, deterministically, for a very small fraction of input combinations. We have also constructed a reliable version of this adder that can detect and correct mistakes when they occur. This creates the possibility of a variable-latency adder that produces a correct result very fast with extremely high probability; however, in some rare cases when an error is detected, the correction term must be applied and the correct result is produced after some time. Since errors occur with extremely low probability, this new type of adder is significantly faster than state-of-the-art adders when the overall latency is averaged over many additions.
Cited by 263 works. doi:10.1145/1403375.1403679
Authors
References
- Conditional-Sum Addition Logic
- A Regular Layout for Parallel Adders
- Computer Arithmetic Algorithms
- A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
- Computer Arithmetic: Algorithms and Hardware Designs
- An extreme value theory for long head runs
- Soft digital signal processing
- A family of adders
- Razor: circuit-level correction of timing errors for low-power operation
- Probabilistic arithmetic and energy efficient embedded signal processing