2016 Euromicro Conference on Digital System Design (DSD) 2016
DOI: 10.1109/dsd.2016.57
|View full text |Cite
|
Sign up to set email alerts
|

Probing Approximate TMR in Error Resilient Applications for Better Design Tradeoffs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
12
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 20 publications
(12 citation statements)
references
References 7 publications
0
12
0
Order By: Relevance
“…Through ATLANTA, it is concluded that input vectors 0000 and 0001 are vulnerable to errors, and hence, are pre‐blocked for approximation. The original function ( G ) is transformed to approximate modules ( fn ) by complementing min/maxterms [1]. A prime implicant (PI) is an implicant that cannot be covered by a more general implicant.…”
Section: Proposed Methodologymentioning
confidence: 99%
See 1 more Smart Citation
“…Through ATLANTA, it is concluded that input vectors 0000 and 0001 are vulnerable to errors, and hence, are pre‐blocked for approximation. The original function ( G ) is transformed to approximate modules ( fn ) by complementing min/maxterms [1]. A prime implicant (PI) is an implicant that cannot be covered by a more general implicant.…”
Section: Proposed Methodologymentioning
confidence: 99%
“…The area overhead problem can be handled through approximate computing using approximate circuits for TMR modules (approximate TMR – ATMR) such that only one of the modules differs from the original circuit at each input vector scenario, allowing the majority voter to still select two match outputs out of three for any input vector. Table 1 shows an ATMR, where f 1, f 2, and f 3 are approximate functions, G is the original function, and V is the voter output [1]. Let us assume that for a given example in Table 1, a TMR is constructed as f1=f2=f3=G and an error occurs at f 2 for input vector 000.…”
Section: Introductionmentioning
confidence: 99%
“…Approximate TMR (ATMR) is based on implementing each redundancy task with a different architecture or algorithm [35]. When applied to hardware projects, ATMR has been presented as a way to achieve fault coverage almost as good as traditional TMR but avoiding the huge area overhead that it costs [36]. Designers might accept a lower fault coverage if the area overhead of the project is to drop significantly.…”
Section: Approximation and Fault Tolerancementioning
confidence: 99%
“…These works have shown good results by compensating the costs of fault tolerance techniques with the speed-up obtained through AC. However, most of the works presented are at the circuit level [10,[31][32][33][34] or require special architecture [9,29,35,36], so hardware modifications are still necessary. This means that those works are not suitable for COTS processors.…”
Section: Fault Tolerance With Approximate Computing Techniquesmentioning
confidence: 99%