Design of Fail-Safe Sequential Machines Using Separable Codes

A method for realization of fail-safe sequential machines, using a class of separable codes called Berger codes in the state assignment, has been presented. The separability property is desirable in certain applications. Both on-set and off-set realizations are used for the next-state functions and this has the advantage over the methods using only on-set realization in that the checker is simpler. Realization of the output circuit is also considered.

[1]  MICHEL DIAZ,et al.  On-Set Realization of Fail-Safe Sequential Machines , 1974, IEEE Transactions on Computers.

[2]  Toshihide Ibaraki,et al.  Fail-Safe Realization of Sequential Machines , 1973, Inf. Control..

[3]  Dwight H. Sawin.  Design of Reliable Synchronous Sequential Circuits , 1975, IEEE Transactions on Computers.

[4]  Jay M. Berger.  A Note on Error Detection Codes for Asymmetric Channels , 1961, Inf. Control..

[5]  Ramaswami Dandapani,et al.  Derivation of Minimal Test Sets for Monotonic Logic Circuits , 1973, IEEE Transactions on Computers.

[6]  Gyula A. Magó,et al.  Monotone Functions in Sequential Circuits , 1973, IEEE Transactions on Computers.

[7]  Gary K. Maki,et al.  Fault-Tolerant Asynchronous Sequential Machines , 1974, IEEE Transactions on Computers.

[8]  Sudhakar M. Reddy,et al.  On Totally Self-Checking Checkers for Separable Codes , 1977, IEEE Transactions on Computers.

[9]  Yoshihiro Tohma,et al.  Realization of Fail-Safe Sequential Machines by Using a k-out-of-n Code , 1971, IEEE Transactions on Computers.

[10]  D. A. Anderson,et al.  Design of self-checking digital networks using coding techniques , 1971 .