Fault Testing and Diagnosis in Combinational Digital Circuits

William H. Kautz

IEEE Transactions on Computers · 1968 · 83 citations · 13 references

Concepts

TL;DR

Designing test schedules for detecting and locating a small number of nontransient faults in combinational digital circuits is a challenging problem. The paper reviews the current state of diagnostics for digital circuits and identifies remaining open problems. The authors define testing and diagnosis as fault detection, fault location, and module‑level fault localization, and present procedures that yield shorter test schedules when input selection may depend on circuit responses. They show that minimal test schedules can be derived using pattern‑recognition and switching‑theory methods under an independence assumption, and that relaxing this assumption can produce significantly shorter schedules.

Abstract

Abstract—he problem of designing test schedules for the testing or diagnosis of a small number of nontransient faults in combinational digital circuits (switching networks) is considered in detail. By testing and diagnosis we mean the following: 1) detection of a fault, 2) location of a fault, and 3) location of a fault within the confines of a prescribed package or module. It is shown that minimal test schedules can be readily derived–using procedures already worked out for solving certain problems in pattern recognition and switching theory–under the assumption that the selection of the test inputs in the schedule is independent of the response of the circuit under test. When this assumption is not made, it is shown that much shorter test schedules are sometimes possible, and procedures are offered for obtaining good ones. Finally, the general status of diagnostics for digital circuits is reviewed and evaluated, and specific problems remaining to be solved are described.

References

13