A Novel Approach for Fast and Accurate Mean Error Distance Computation in Approximate Adders
Avishek Sinha Roy, Anindya Sundar Dhar

TL;DR
This paper introduces a new fast and accurate method for calculating the mean error distance in approximate adders, improving over existing simulation techniques in accuracy and speed.
Contribution
A novel algorithm for exact mean error distance computation in approximate adders, enhancing efficiency and accuracy over Monte Carlo methods.
Findings
Proposed method outperforms Monte Carlo simulation in accuracy.
The algorithm reduces computation time significantly.
Experimental results validate the effectiveness of the approach.
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
