Near-minimal test sets for the detection of single gate faults

Abstract

A new algorithm is presented for the detection of single gate faults in combinational networks. A gate fault is any unknown transformation of the Boolean function realized by a particular gate or single-output subnetwork. Detection of such faults is accomplished by verifying the truth table of the correct gate function. The concept of real transform of a Boolean function is utilized to obtain in each iteration an optimal test, namely, a test that performs as much of the fault detection task as possible. The resulting test set is near-minimal and complete. The algorithm can handle multi-output networks, integrated network components and mixed (gate, stuck-at) fault models.