.png){kind=icon}
Return
Approximate Full-Adders: A Comprehensive Analysis
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2024.3463182.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Approximate computing is a technique that sacrifices the accuracy of the result for an advantage in terms of power, area, and speed. It is useful for error-tolerant applications such as image and video processing. Many approximate arithmetic circuits can be devised using approximate versions of the basic binary full adder that simply adds three bits to generate carry and sum. Therefore, the approximate full adder has been the subject of extensive investigation in recent years. In this paper we present a comprehensive analysis of approximate full adders, by synthesizing in a FinFET 14 nm technology the whole set of possible designs, achievable by modifying one or more entries of the full adder truth-table. Our exhaustive analysis shows that only a few out of the many thousands of synthesized circuits perform reasonably well as approximate full adders. Our analysis re-discovers the approximate full adders already proposed in the literature and identifies some new ones. Examples of using the newly discovered approximate full adders in typical error resilient applications are provided, showing the performance and the usefulness of approximate arithmetic circuit designs in the real-world.
Keywords:
approximate full adders
Approximate computing
binary adders
binary multipliers
binary multipliers
digital arithmetic
digital arithmetic
binary multipliers
digital arithmetic
Journal
IF:
3.6
Papers:
9.8W
Citations:
29.4W
Organization
Cited Papers
ShareSaveLow-angle collision with Earth: The elliptical impact crater Matt Wilson, Northern Territory, Australia.png)
Geology
GeologyIF0
PREAI
ShareSaveShareSave
View more