An Efficient Algorithm for Finding the K Longest Testable Paths Through Each Gate in a Combinational Circuit

Testing the K longest paths through each gate (KLPG) in a circuit detects the smallest local delay faults under process variation. In this work a novel automatic test pattern generation (ATPG) methodology to find the K longest testable paths through each gate in a combinational circuit is presented. Many techniques are used to significantly reduce the search space. The results on the ISCAS benchmark circuits show that this methodology is very efficient and able to handle circuits with an exponential number of paths, such as c6288.

An Efficient Algorithm for Finding the K Longest Testable Paths Through Each Gate in a Combinational Circuit Conference Paper