An approximate voting scheme for reliable computing

This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing. A scheme that utilizes approximate voting is proposed; it is referred to as inexact double modular redundancy (IDMR). IDMR does not resort to triplication, thu...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 Design, Automation & Test in Europe Conference & Exhibition (DATE) s. 293 - 296
Hlavní autoři: Ke Chen, Lombardi, Fabrizio, Jie Han
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: EDAA 01.03.2015
Témata:
Approximate computing
Complexity theory
Delays
Modular Redundancy
PSNR
Redundancy
Reliable system
Tunneling magnetoresistance
Voting
ISSN:1530-1591
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper relies on the principles of inexact computing to alleviate the issues arising in static masking by voting for reliable computing. A scheme that utilizes approximate voting is proposed; it is referred to as inexact double modular redundancy (IDMR). IDMR does not resort to triplication, thus saving overhead due to modular replication; moreover, this scheme is adaptive in its operation, i.e., it allows a threshold to determine the validity of the module outputs. IDMR operates by initially establishing the difference between the values of the outputs of the two modules; only if the difference is below a preset threshold, then the voter calculates the average value of the two module outputs. An extensive analysis of the voting circuits and an application to image processing are presented.
ISSN:1530-1591
DOI:10.5555/2755753.2755818