Article (2015)
|
|
Open Access to the full text of this document Published Version Terms of Use: Creative Commons Attribution Download (463kB) |
Abstract
Triple Modular Redundancy (TMR) is a common technique to protect memory elements for digital processing systems subject to radiation effects (such as in space, high-altitude, or near nuclear sources). This paper presents an approach to verify the correct implementation of TMR for the memory elements of a given netlist (i.e., a digital circuit specification) using heuristic analysis. The purpose is detecting any issues that might incur during the use of automatic tools for TMR insertion, optimization, place and route, etc. Our analysis does not require a testbench and can perform full, exhaustive coverage within less than an hour even for large designs. This is achieved by applying a divide et impera approach, splitting the circuit into smaller submodules without loss of generality, instead of applying formal verification to the whole netlist at once. The methodology has been applied to a production netlist of the LEON2-FT processor that had reported errors during radiation testing, successfully showing a number of unprotected memory elements, namely 351 flip-flops.
Uncontrolled Keywords
| Department: | Department of Computer Engineering and Software Engineering |
|---|---|
| PolyPublie URL: | https://publications.polymtl.ca/3617/ |
| Journal Title: | PeerJ Computer Science |
| Publisher: | PeerJ |
| DOI: | 10.7717/peerj-cs.21 |
| Official URL: | https://doi.org/10.7717/peerj-cs.21 |
| Date Deposited: | 17 Feb 2020 11:14 |
| Last Modified: | 27 Sep 2024 05:06 |
| Cite in APA 7: | Beltrame, G. (2015). Triple Modular Redundancy verification via heuristic netlist analysis. PeerJ Computer Science. https://doi.org/10.7717/peerj-cs.21 |
|---|---|
Statistics
Total downloads
Downloads per month in the last year
Origin of downloads
Dimensions
