Fault-tolerant computing: theory and techniques; Vol. 2
Fault-tolerant computing: theory and techniques; Vol. 2
Computer arithmetic algorithms
Computer arithmetic algorithms
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
Efficient Totally Self-Checking Shifter Design
Journal of Electronic Testing: Theory and Applications - Special issue on On-line testing
Fault-secure shifter design: results and implementations
EDTC '97 Proceedings of the 1997 European conference on Design and Test
| Hi-index | 0.00 |
Parity prediction arithmetic operator schemes have the advantage to be compatible with data paths and memory systems checked by parity codes. Nevertheless, the basic drawback of these schemes is that they may not be fault secure for single faults, since they propagate to multiple output errors that are undetectable by the parity code. In this paper we derive necessary and sufficient conditions for parity prediction arithmetic operators to achieve the fault secure property. From these conditions, various fault secure designs for arithmetic operators are reported.