An Optimised Design of a 4-bit Carry Look-Ahead Adder Using Novel Reversible Logic Gates

Reversible logic gates are pivotal in the advancement of low-power and quantum computing technologies due to their ability to operate without generating heat from information loss. This field of study has emerged as a forefront of research, propelling innovative advancements aimed at optimizing resource efficiency. This paper presents the design and implementation of a 4-bit Carry Look-Ahead (CLA) adder using reversible logic gates, significantly enhancing arithmetic operation speed by computing carry bits in parallel. The CLA adder uses generate (G<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf>) and propagate (P<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf>) functions to determine carry bits, reducing the delay associated with traditional adders. The proposed design leverages a combination of Peres and Feynman gates to construct the Carry Propagate and Carry Generate Adder (PGA) block, producing the necessary carry and sum outputs efficiently. There is an approximate 41% improvement in the total reversible implementation cost (TRLIC) of the design. Evaluated using Vivado 2022.2 with Verilog HDL, the design demonstrates accurate and efficient performance across all 4-bit input combinations, significantly reducing propagation delay.

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1109/iacis61494.2024.10721739
Citations
3
Primary Topic
Quantum-Dot Cellular Automata
Type
article
Field-Weighted Citation Impact
1.08
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Optimised Design of a 4-bit Carry Look-Ahead Adder Using Novel Reversible Logic Gates

Aruru Sai Kumar, N. Neelima, Narendra Pratap, V Phani Kumar et al.
3 citations
Quantum-Dot Cellular Automata
1.08
article

An Optimised Design of a 4-bit Carry Look-Ahead Adder Using Novel Reversible Logic Gates

Aruru Sai Kumar, N. Neelima, Narendra Pratap, V Phani Kumar, Tithi Chetan Mahajani, Pachava Anunya
article en
3 citations

Abstract

Reversible logic gates are pivotal in the advancement of low-power and quantum computing technologies due to their ability to operate without generating heat from information loss. This field of study has emerged as a forefront of research, propelling innovative advancements aimed at optimizing resource efficiency. This paper presents the design and implementation of a 4-bit Carry Look-Ahead (CLA) adder using reversible logic gates, significantly enhancing arithmetic operation speed by computing carry bits in parallel. The CLA adder uses generate (G<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf>) and propagate (P<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf>) functions to determine carry bits, reducing the delay associated with traditional adders. The proposed design leverages a combination of Peres and Feynman gates to construct the Carry Propagate and Carry Generate Adder (PGA) block, producing the necessary carry and sum outputs efficiently. There is an approximate 41% improvement in the total reversible implementation cost (TRLIC) of the design. Evaluated using Vivado 2022.2 with Verilog HDL, the design demonstrates accurate and efficient performance across all 4-bit input combinations, significantly reducing propagation delay.

G Pulla Reddy Dental College & Hospital (IN)
Affordable and clean energy
Openalex Percentile: Top 19%
Quantum-Dot Cellular Automata
1.08
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.