A New Test Vector Search Algorithm for a Single Stuck-at Fault Using Probabilistic Correlation

It has been mathematically shown that the testing problem is NP complete. Numerous attempts have been made in creating and designing algorithms to successfully test a digital circuit for all faults in computational linear time. However, due to the complexity of the NP problem, all these attempts start becoming exponential with an increase in circuit size and complexity. Algorithms have been proposed where successful vectors have been used to search for more test vectors with similar properties. However, this leads to a bottleneck when trying to find hard to find stuck-at faults which have only one or two unique tests and their properties may not match other previously successful tests. We propose a new probability based algorithm where new test vectors are generated based on the input probability correlation of previously unsuccessful test vectors. By looking at the correlation between the primary inputs for previously generated test vectors, we use the probability information of 1's or 0's at a primary input with respect to other inputs to skew the search in the test vector space. We have shown test time improvements for a 10 input AND gate, c17 and c432 benchmark circuits. We have also shown improvements when comparing our algorithm with a random test generator and weighted-random test generator.