A state encoding for self-checking finite state machines

The design of self-checking FSMs can be achieved by adopting an encoding for the state, for the output or for both. In this paper a state encoding in which the Hamming distance between each state and its possible next states is constant is proposed. The adoption of such an encoding and the application of specific techniques for achieving a complete fault detection property for faults occurring in the next-state logic are presented. Area overhead and fault coverage results on a set of MCNC benchmark FSMs are provided.

[1]  Régis Leveugle,et al.  Optimized Synthesis of Concurrently Checked Controllers , 1990, IEEE Trans. Computers.

[2]  Srinivas Devadas,et al.  Test generation and verification for highly sequential circuits , 1991, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  F. Y. Busaba,et al.  Self-checking sequential circuit design using m-out-of-n codes , 1993 .

[4]  Niraj K. Jha,et al.  Design and synthesis of self-checking VLSI circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Régis Leveugle,et al.  Alternative approaches to fault detection in FSMs , 1994, IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems.

[6]  Bernard Courtois,et al.  Strongly Code Disjoint Checkers , 1988, IEEE Trans. Computers.

[7]  Y. Savaria,et al.  Soft-error filtering: A solution to the reliability problem of future VLSI digital circuits , 1986, Proceedings of the IEEE.

[8]  S. M. Reddy.  Note on Self-Checking Checkers , 1974, IEEE Transactions on Computers.

[9]  Prithviraj Banerjee,et al.  RSYN: a system for automated synthesis of reliable multilevel circuits , 1994, IEEE Trans. Very Large Scale Integr. Syst..

[10]  James E. Smith,et al.  Strongly Fault Secure Logic Networks , 1978, IEEE Transactions on Computers.

[11]  Chung-Len Lee,et al.  Simplifying Sequential Circuit Test Generation , 1994, IEEE Des. Test Comput..