Design of Synchronous Section-Carry Based Carry Lookahead Adders with Improved Figure of Merit

06/17/2016
by   P Balasubramanian, et al.
0

The section-carry based carry lookahead adder (SCBCLA) architecture was proposed as an efficient alternative to the conventional carry lookahead adder (CCLA) architecture for the physical implementation of computer arithmetic. In previous related works, self-timed SCBCLA architectures and synchronous SCBCLA architectures were realized using standard cells and FPGAs. In this work, we deal with improved realizations of synchronous SCBCLA architectures designed in a semi-custom fashion using standard cells. The improvement is quantified in terms of a figure of merit (FOM), where the FOM is defined as the inverse product of power, delay and area. Since power, delay and area of digital designs are desirable to be minimized, the FOM is desirable to be maximized. Starting from an efficient conventional carry lookahead generator, we show how an optimized section-carry based carry lookahead generator is realized. In comparison with our recent work dealing with standard cells based implementation of SCBCLAs to perform 32-bit addition of two binary operands, we show in this work that with improved section-carry based carry lookahead generators, the resulting SCBCLAs exhibit significant improvements in FOM. Compared to the earlier optimized hybrid SCBCLA, the proposed optimized hybrid SCBCLA improves the FOM by 88.3 improvement in FOM by 77.3 the proposed optimized hybrid SCBCLA is still the winner and has a better FOM than the currently optimized hybrid CCLA by 15.3 are implemented to realize 32-bit dual-operand binary addition using a 32/28nm CMOS process.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/25/2016

ASIC-based Implementation of Synchronous Section-Carry Based Carry Lookahead Adders

The section-carry based carry lookahead adder (SCBCLA) topology was prop...
research
10/02/2018

Performance Comparison of some Synchronous Adders

This technical note compares the performance of some synchronous adders ...
research
04/14/2016

Area/latency optimized early output asynchronous full adders and relative-timed ripple carry adders

This article presents two area/latency optimized gate level asynchronous...
research
07/11/2022

Ternary and Quaternary CNTFET Full Adders are less efficient than the Binary Ones for Carry-Propagate Adders

In Carry Propagate Adders, carry propagation is the critical delay. The ...
research
03/10/2016

Design and Implementation of an Improved Carry Increment Adder

A complex digital circuit comprises of adder as a basic unit. The perfor...
research
07/11/2023

Area, Delay, and Energy-Efficient Full Dadda Multiplier

The Dadda algorithm is a parallel structured multiplier, which is quite ...
research
08/25/2019

4-Bit High-Speed Binary Ling Adder

Binary addition is one of the most primitive and most commonly used appl...

Please sign up or login with your details

Forgot password? Click here to reset