Search engine for discovering works of Art, research articles, and books related to Art and Culture
ShareThis
Javascript must be enabled to continue!

Analysis of Approximate adders with single functional error

View through CrossRef
Approximate computing has been extensively employed in arithmetic circuits such as a ripple carry adder (RCA); in an approximate adder, errors are introduced by design. VLSI circuits are also prone to errors caused by external and physical phenomena (such as cosmic rays or a stuck-at); hereafter, these errors are referred to as functional. This paper investigates the combined effects of single functional error (SFE) in an approximate cell and an RCA. The exact and approximate cell designs are considered using a state transition diagram-based analysis to identify relationships between the types of functional error in a cell against the expected behavior for all possible cases. A probabilistic analysis for an exact RCA is proposed; it shows excellent agreement with the simulation results for different metrics such as the error rate (ER). Next, an error analysis is performed on the RCA by considering the number of approximate cells as well as the location of the erroneous cell; the simulation results and modeling analysis of the exact RCA show and prove that the ER and MED (Mean Error Distance) of odd-numbered cases is higher than for evennumbered cases. Moreover, the MED for an approximate RCA in the presence of an SFE is higher than for the exact RCA. Simulation and analytical results show that an approximate RCA in the presence of an SFE can have a serious degradation in accuracy performance if the approximate cell type is not properly selected. In addition, the binary tree-based mathematical analysis and pseudocode are provided to support the exhaustive simulation results for the ER of the RCA using different approximate cells.
Institute of Electrical and Electronics Engineers (IEEE)
Title: Analysis of Approximate adders with single functional error
Description:
Approximate computing has been extensively employed in arithmetic circuits such as a ripple carry adder (RCA); in an approximate adder, errors are introduced by design.
VLSI circuits are also prone to errors caused by external and physical phenomena (such as cosmic rays or a stuck-at); hereafter, these errors are referred to as functional.
This paper investigates the combined effects of single functional error (SFE) in an approximate cell and an RCA.
The exact and approximate cell designs are considered using a state transition diagram-based analysis to identify relationships between the types of functional error in a cell against the expected behavior for all possible cases.
A probabilistic analysis for an exact RCA is proposed; it shows excellent agreement with the simulation results for different metrics such as the error rate (ER).
Next, an error analysis is performed on the RCA by considering the number of approximate cells as well as the location of the erroneous cell; the simulation results and modeling analysis of the exact RCA show and prove that the ER and MED (Mean Error Distance) of odd-numbered cases is higher than for evennumbered cases.
Moreover, the MED for an approximate RCA in the presence of an SFE is higher than for the exact RCA.
Simulation and analytical results show that an approximate RCA in the presence of an SFE can have a serious degradation in accuracy performance if the approximate cell type is not properly selected.
In addition, the binary tree-based mathematical analysis and pseudocode are provided to support the exhaustive simulation results for the ER of the RCA using different approximate cells.

Related Results

Fixed point multi-bit approximate adder based convolutional neural network accelerator for digit classification inference
Fixed point multi-bit approximate adder based convolutional neural network accelerator for digit classification inference
Approximate computing is a rapidly growing technique to speed up applications with less computational effort while maintaining the accuracy of error-resilient applications such as ...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
<p>Approximate cells can be used to design Ripple Carry Adders (RCAs) for realizing approximate addition in energy-efficient CMOS digital circuits. As inputs of approximate c...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
Approximate cells can be used to design Ripple Carry Adders (RCAs) for realizing approximate addition in energy-efficient CMOS digital circuits. As inputs of approximate cells coul...
Research and Design of Multibit Binary Adders on Fpga
Research and Design of Multibit Binary Adders on Fpga
This paper provides an analysis of the system characteristics and functional capabilities of various types of adders for the high-speed component construction of arithmetic and log...
Design and Implementation of 32-Bit High Valency Jackson Adders
Design and Implementation of 32-Bit High Valency Jackson Adders
Parallel prefix addition offers a highly efficient solution to most of the applications which requires fast addition of two binary numbers. An efficient adder design demands proper...
Approximate Reverse Carry Propagate Adder for Energy-Efficiency
Approximate Reverse Carry Propagate Adder for Energy-Efficiency
The hypothesis of estimated measure is to design computation quality for computation efforts. The Approximate full adders (AFA’s) are the lead objective to reduce the length of car...
Improving 256x256 Vedic Multiplier Design Using Optimized Adder Architectures
Improving 256x256 Vedic Multiplier Design Using Optimized Adder Architectures
Abstract: This report presents an in-depth study focused on improving the computational efficiency of a 256×256 Vedic multiplier design, leveraging advanced adder architectures to ...
A Novel High Computing Power Efficient VLSI Architectures of Three Operand Binary Adders
A Novel High Computing Power Efficient VLSI Architectures of Three Operand Binary Adders
Directly or indirectly adders are the basic elements in almost all digital circuits, three operand adders are the basic building blocks in LCG (Linear congruential generator) based...

Back to Top