Multiple Fault Detection for Combinational Logic Circuits
- 1 March 1975
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-24 (3) , 233-242
- https://doi.org/10.1109/T-C.1975.224204
Abstract
An algorithm for generating test sets to detect all the multiple stuck-at-faults in combinational logic circuits is presented. This algorithm generates a test set using a set of functions, called representative functions, which consists of much fewer functions than all possible multiple stuck-at fault functions, but is sufficient for test generation. Two different methods of finding such a set of representative functions are presented. The test sets derived from the set of representative functions obtained by the first method will be smaller than that by the second method, but the second method is much simpler than the first especially for highly redundant circuits. Nevertheless, the complexity of this algorithm using the first method is about the same as that of Bossen and Hong's algorithm which is the simplest existing algorithm under the multiple stuck-at fault assumption, and yet the number of tests in a test set generated will always be smaller for redundant circuits and the same for irredundant circuits as that generated by Bossen and Hong's algorithm for irredundant circuits.Keywords
This publication has 14 references indexed in Scilit:
- Minimal Fault Tests for Combinational NetworksIEEE Transactions on Computers, 1974
- Multiple-Fault Detection and Location in Fan-Out Free Combinational CircuitsIEEE Transactions on Computers, 1974
- Multiple Fault Detection in Combinational Circuits: Algorithms and Computational ResultsIEEE Transactions on Computers, 1973
- A New Representation for Faults in Combinational Digital CircuitsIEEE Transactions on Computers, 1972
- Detection of Multiple Faults in Combinational Logic NetworksIEEE Transactions on Computers, 1972
- Cause-Effect Analysis for Multiple Fault Detection in Combinational NetworksIEEE Transactions on Computers, 1971
- An Efficient Algorithm for Generating Complete Test Sets for Combinational Logic CircuitsIEEE Transactions on Computers, 1971
- Analyzing Errors with the Boolean DifferenceIEEE Transactions on Computers, 1968
- Programmed Algorithms to Compute Tests to Detect and Distinguish Between Failures in Logic CircuitsIEEE Transactions on Electronic Computers, 1967
- Fault Detection in Redundant CircuitsIEEE Transactions on Electronic Computers, 1967