Strongly code disjoint checkers
- 1 June 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 37 (6), 751-756
- https://doi.org/10.1109/12.2217
Abstract
Strongly code-disjoint (SCD) checkers are defined and shown to include totally self-checking (TSC) code-disjoint checkers. This type of checker is the natural companion of strongly fault-secure (SFS) networks. SCD checkers are the largest class of checkers with which a combinational system may achieve the TSC goal. Some examples are given to illustrate the design of SCD checkersKeywords
This publication has 6 references indexed in Scilit:
- Strongly code disjoint checkersIEEE Transactions on Computers, 1988
- Physical Versus Logical Fault Models MOS LSI Circuits: Impact on Their TestabilityIEEE Transactions on Computers, 1980
- Strongly Fault Secure Logic NetworksIEEE Transactions on Computers, 1978
- On Totally Self-Checking Checkers for Separable CodesIEEE Transactions on Computers, 1977
- Partially Self-Checking Circuits and Their Use in Performing Logical OperationsIEEE Transactions on Computers, 1974
- Fault Equivalence in Combinational Logic NetworksIEEE Transactions on Computers, 1971