2022
DOI: 10.1109/ojnano.2022.3153329
|View full text |Cite
|
Sign up to set email alerts
|

Low-Power Approximate RPR Scheme for Unsigned Integer Arithmetic Computation

Abstract: A scheme often used for error tolerance of arithmetic circuits is the so-called Reduced Precision Redundancy (RPR). Rather than replicating multiple times the entire module, RPR uses reduced precision (inexact) copies to significantly reduce the redundancy overhead, while still being able to correct the largest errors. This paper focuses on the low-power operation for RPR; a new scheme is proposed. At circuit level, power gating is initially utilized in the arithmetic modules to power off one of the modules (i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…However, one of the major issues with the RPR scheme is its complex voter and consequently imposed overheads, which is due to the required extra hardware for comparing the results of full precision and reduced precision modules with each other, and also with a predetermined threshold for generating the final output [8], [29]. In [35], a circuit-level power gating-based RPR scheme for unsigned integer arithmetic units was proposed. In this method, the full precision module is powered off, and in case the difference between the outputs of the reduced precision modules is higher than a threshold, the full precision module is turned on to achieve higher accuracy.…”
Section: B Approximate Computing In Fault-tolerant Systemsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, one of the major issues with the RPR scheme is its complex voter and consequently imposed overheads, which is due to the required extra hardware for comparing the results of full precision and reduced precision modules with each other, and also with a predetermined threshold for generating the final output [8], [29]. In [35], a circuit-level power gating-based RPR scheme for unsigned integer arithmetic units was proposed. In this method, the full precision module is powered off, and in case the difference between the outputs of the reduced precision modules is higher than a threshold, the full precision module is turned on to achieve higher accuracy.…”
Section: B Approximate Computing In Fault-tolerant Systemsmentioning
confidence: 99%
“…Unlike state-of-the-art techniques that either target only approximating voter (such as [6][7]) or only approximating certain redundant modules (like [8] [35]), in this paper, we aim at targeting full system approximations where both redundant compute modules and voter can be approximated to leverage the full potential of approximate computing. However, this comes with certain additional challenges, e.g., meeting the user-defined output quality constraint and removing the required complex voters in the RPR-based designs.…”
Section: B Approximate Computing In Fault-tolerant Systemsmentioning
confidence: 99%