DeepAI AI Chat
Log In Sign Up

A Novel Approach for Fast and Accurate Mean Error Distance Computation in Approximate Adders

by   Avishek Sinha Roy, et al.
IIT Kharagpur

In error-tolerant applications, approximate adders have been exploited extensively to achieve energy efficient system designs. Mean error distance is one of the important error metrics used as a performance measure of approximate adders. In this work, a fast and efficient methodology is proposed to determine the exact mean error distance in approximate lower significant bit adders. A detailed description of the proposed algorithm along with an example has been demonstrated in this paper. Experimental analysis shows that the proposed method performs better than existing Monte Carlo simulation approach both in terms of accuracy and execution time.


page 1

page 2

page 3

page 4


Hamming Distance Tolerant Content-Addressable Memory (HD-CAM) for Approximate Matching Applications

We propose a novel Hamming distance tolerant content-addressable memory ...

Some Algorithms on Exact, Approximate and Error-Tolerant Graph Matching

The graph is one of the most widely used mathematical structures in engi...

Computing Effective Resistances on Large Graphs Based on Approximate Inverse of Cholesky Factor

Effective resistance, which originates from the field of circuits analys...

Commuting Variability by Wage Groups in Baton Rouge 1990-2010

Residential segregation recently has shifted to more class or income-bas...

Approximation with Error Bounds in Spark

We introduce a sampling framework to support approximate computing with ...