Speed and Energy Optimised Quasi-Delay-Insensitive Block Carry Lookahead Adder
P. Balasubramanian, D.L. Maskell, N.E. Mastorakis

TL;DR
This paper introduces a new asynchronous quasi-delay-insensitive block carry lookahead adder (BCLARC) that outperforms existing adders in speed and energy efficiency using dual-rail encoding and specific handshaking protocols.
Contribution
The paper presents a novel QDI BCLARC design with redundancy carry, achieving significant improvements in speed and energy efficiency over existing asynchronous adders.
Findings
20.5% reduction in cycle time compared to QDI RCA
47.5% reduction in cycle time compared to QDI CCLA
32.9% reduction in cycle time compared to QDI CSLA
Abstract
We present a new asynchronous quasi-delay-insensitive (QDI) block carry lookahead adder with redundancy carry (BCLARC) realized using delay-insensitive dual-rail data encoding and 4-phase return-to-zero (RTZ) and 4-phase return-to-one (RTO) handshaking. The proposed QDI BCLARC is found to be faster and energy-efficient than the existing asynchronous adders which are QDI and non-QDI (i.e., relative-timed). Compared to existing asynchronous adders corresponding to various architectures such as ripple carry adder (RCA), conventional carry lookahead adder (CCLA), carry select adder (CSLA), BCLARC, and hybrid BCLARC-RCA, the proposed BCLARC is found to be faster and more energy-optimised. The cycle time (CT), which is the sum of forward and reverse latencies, governs the speed; and the product of average power dissipation and cycle time viz. the power-cycle time product (PCTP) defines the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum-Dot Cellular Automata · Low-power high-performance VLSI design · VLSI and Analog Circuit Testing
