An ESL Environment for Modeling Electrical Interconnect Faults

Nosrati, Nooshin; Basharkhah, Katayoon; Sadeghi, Rezgar; Navabi, Zainalabedin

doi:10.1109/isvlsi.2019.00024

Cited by 4 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Code-based techniques add information redundancy with the property that certain errors can be detected or sometimes corrected. While non-arithmetic codes, like Hamming and Cyclic codes, are well-suited for memory [30] and communication [35] protection, data processing can efficiently be protected through arithmetic codes like ANcodes and residue codes [27], [28], [36], [37].…”

Section: Arithmetic Error Codesmentioning

confidence: 99%

Analysis and Enhancement of Resilience for LSTM Accelerators Using Residue-Based CEDs

Nosrati,

Navabi

2024

IEEE Access

Self Cite

View full text Add to dashboard Cite

As Long Short-Term Memory (LSTM) accelerators are increasingly being employed in safetycritical applications with high-reliability demands, protecting them against errors becomes imperative. Traditional protection techniques for LSTMs are either costly, conflict with strict area and power constraints for neural network accelerators, or introduce performance overhead that is untenable for real-time and latency-critical accelerators. In this paper, we propose residue-based Concurrent Error Detection (CED) schemes to detect transient faults and alleviate their impact during LSTM computations. CED units are employed in a coarse-grain or fine-grain fashion, depending on the granularity of the components being protected from the whole LSTM computations to individual processing elements. In pursuit of a more costeffective strategy, we use fine-grain CEDs in a selective manner based on the resilience characteristics of LSTM. The selections are made spatially for LSTM synaptic weights or temporally based on LSTM time steps. The experimental results show that the proposed residue-based CEDs (i) can achieve nearly complete fault coverage even under extremely large bit error rates, (ii) significantly decrease misprediction rates compared to the unprotected LSTM, and (iii) incur low overhead without compromising performance. Our method is compared with modular redundancy techniques such as DMR and TMR (Double and Triple Modular Redundancy).

show abstract