Fault-Secure Parity Prediction Arithmetic Operators

Although parity prediction arithmetic operators are compatible with systems checked by parity codes, they are not secure against single faults. The authors determine the necessary conditions for fault secureness and derive designs embodying these conditions.

[1]  Michael Nicolaidis,et al.  Efficient implementations of self-checking adders and ALUs , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[2]  Kai Hwang,et al.  Computer arithmetic: Principles, architecture, and design , 1979 .

[3]  Sudhakar M. Reddy,et al.  On the effectiveness of residue code checking for parallel two's complement multipliers , 1994, Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing.

[4]  Israel Koren.  Computer arithmetic algorithms , 1993 .

[5]  Uwe Sparmann,et al.  On the check base selection problem for fast adders , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.

[6]  Algirdas Avizienis,et al.  Arithmetic Algorithms for Error-Coded Operands , 1973, IEEE Transactions on Computers.

[7]  Frederick F. Sellers,et al.  Error detecting logic for digital computers , 1968 .

[8]  Yervant Zorian,et al.  Fault-secure shifter design: results and implementations , 1997, Proceedings European Design and Test Conference. ED & TC 97.