Pith. sign in

REVIEW

An Approximate Carry Estimating Simultaneous Adder with Rectification

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2008.11591 v1 pith:SBQRT4H5 submitted 2020-08-26 cs.AR

classification cs.AR
keywords adderapproximatecarryrectificationresultsaccuracyadditionbasic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Approximate computing has in recent times found significant applications towards lowering power, area, and time requirements for arithmetic operations. Several works done in recent years have furthered approximate computing along these directions. In this work, we propose a new approximate adder that employs a carry prediction method. This allows parallel propagation of the carry allowing faster calculations. In addition to the basic adder design, we also propose a rectification logic which would enable higher accuracy for larger computations. Experimental results show that our adder produces results 91.2% faster than the conventional ripple-carry adder. In terms of accuracy, the addition of rectification logic to the basic design produces results that are more accurate than state-of-the-art adders like SARA and BCSA by 74%.

Discussion (0). Continue with ORCID to comment.

Pith tools