Error-correcting Goldschmidt dividers using time shared TMR

Gallagher, W.L.; Seartzlander, E.E.

doi:10.1109/dftvs.1998.732170

Cited by 7 publications

(2 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A time redundancy variant of TMR called RE-computing with Triplication With Voting (RETWV) trades-off area overhead for increased error detection/correction latency [9,10,11]. RETWV is similar to REDWC except that it partitions the operations and operators into thirds.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Algorithm level re-computing-a register transfer level concurrent error detection technique

Wu¹,

Karri²

IEEE/ACM International Conference on Computer Aided Design. ICCAD 2001. IEEE/ACM Digest of Technical Papers (Cat. No.01CH37281)

View full text Add to dashboard Cite

Abstract* : In this paper we propose two algorithm-level time redundancy based Concurrent Error Detection (CED) schemes that exploit diversity in a Register Transfer (RT) level implementation. RT level diversity can be achieved either by changing the operation-to-operator allocation (allocation diversity) or by shifting the operands before re-computation (data diversity). By enabling a fault to affect the normal result and the re-computed result in two different ways, RT level diversity yields good CED capability with low area overhead. We used Synopsys Behavior Complier (BC) to implement the technique.

show abstract

Section: Introductionmentioning

confidence: 99%

“…RETWV is similar to REDWC except that it partitions the operations and operators into thirds. RETWV has been applied to inner product units and convolvers [9], Newton-Raphson dividers [10] and Goldschmidt dividers [11]. Performance overhead of time redundancy based error correction is about 200%.…”

Section: Introductionmentioning

confidence: 99%