Syndrome-Testable Design of Combinational Circuits
- 1 June 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-29 (6), 442-451
- https://doi.org/10.1109/tc.1980.1675603
Abstract
Classical testing of combinational circuits requires a list of the fault-free response of the circuit to the test set. For most practical circuits implemented today the large storage requirement for such a list makes such a test procedure very expensive. Moreover, the computational cost to generate the test set increases exponentially with the circuit size.Keywords
This publication has 9 references indexed in Scilit:
- Syndrome-Testable Design of Combinational CircuitsIEEE Transactions on Computers, 1980
- A Practical Approach to Fault Detection in Combinational NetworksIEEE Transactions on Computers, 1978
- Efficiency of Random Compact TestingIEEE Transactions on Computers, 1978
- Transition Count Testing of Combinational Logic CircuitsIEEE Transactions on Computers, 1976
- Probabilistic Treatment of General Combinational NetworksIEEE Transactions on Computers, 1975
- Detection of Multiple Faults in Combinational Logic NetworksIEEE Transactions on Computers, 1972
- On Realizations of Boolean Functions Requiring a Minimal or Near-Minimal Number of TestsIEEE Transactions on Computers, 1971
- Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic CircuitsIEEE Transactions on Electronic Computers, 1967
- On Finding a Nearly Minimal Set of Fault Detection Tests for Combinational Logic NetsIEEE Transactions on Electronic Computers, 1966