Speed and Energy Optimised Quasi-Delay-Insensitive Block Carry Lookahead Adder

03/22/2019
by   P Balasubramanian, et al.
0

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 low power/energy efficiency. For a 32-bit addition, the proposed QDI BCLARC achieves the following average reductions in design metrics over its counterparts when considering RTZ and RTO handshaking: i) 20.5 reductions in CT and PCTP respectively compared to an optimum QDI early output RCA, ii) 16.5 optimum relative-timed RCA, iii) 32.9 respectively compared to an optimum uniform input-partitioned QDI early output CSLA, iv) 47.5 optimum QDI early output CCLA, v) 14.2 respectively compared to an optimum QDI early output BCLARC, and vi) 12.2 11.6 output hybrid BCLARC-RCA. The adders were implemented using a 32/28nm CMOS technology.

READ FULL TEXT
research
10/16/2017

Asynchronous Early Output Section-Carry Based Carry Lookahead Adder with Alias Carry Logic

A new asynchronous early output section-carry based carry lookahead adde...
research
10/02/2018

Performance Comparison of some Synchronous Adders

This technical note compares the performance of some synchronous adders ...
research
07/11/2023

Area, Delay, and Energy-Efficient Full Dadda Multiplier

The Dadda algorithm is a parallel structured multiplier, which is quite ...
research
03/25/2016

Global versus Local Weak-Indication Self-Timed Function Blocks - A Comparative Analysis

This paper analyzes the merits and demerits of global weak-indication se...
research
07/24/2019

Performance Comparison of Quasi-Delay-Insensitive Asynchronous Adders

In this technical note, we provide a comparison of the design metrics of...
research
05/12/2016

An Asynchronous Early Output Full Adder and a Relative-Timed Ripple Carry Adder

This article presents the design of a new asynchronous early output full...
research
01/27/2019

Asynchronous Early Output Block Carry Lookahead Adder with Improved Quality of Results

A new asynchronous early output block carry lookahead adder (BCLA) incor...

Please sign up or login with your details

Forgot password? Click here to reset