A Note on Strongly Fault-Secure Sequential Circuits
- 1 September 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (9) , 1121-1123
- https://doi.org/10.1109/tc.1987.5009545
Abstract
It is proved that any sequential circuit with its next-state function d and output function w is strongly fault secure for unidirectional faults in d and w if i) the outputs of w are encoded in an unordered code, and ii) d and w are implemented with inverter-free circuits.Keywords
This publication has 10 references indexed in Scilit:
- Error secure/propagating concept and its application to the design of strongly fault-secure processorsIEEE Transactions on Computers, 1988
- A Theory of Totally Self-Checking System DesignIEEE Transactions on Computers, 1983
- Unified Design of Self-Checking and Fail-Safe Combinational Circuits and Sequential MachinesIEEE Transactions on Computers, 1979
- Strongly Fault Secure Logic NetworksIEEE Transactions on Computers, 1978
- Design of Fail-Safe Sequential Machines Using Separable CodesIEEE Transactions on Computers, 1978
- On-Set Realization of Fail-Safe Sequential MachinesIEEE Transactions on Computers, 1974
- Design of Totally Self-Checking Check Circuits for m-Out-of-n CodesIEEE Transactions on Computers, 1973
- N-Fail-Safe Sequential MachinesIEEE Transactions on Computers, 1972
- Realization of Fail-Safe Sequential Machines by Using a k-out-of-n CodeIEEE Transactions on Computers, 1971
- Basic Properties and a Construction Method for Fail-Safe Logical SystemsIEEE Transactions on Electronic Computers, 1967