Improved Cutting Algorithm
Original Publication Date: 1989-Oct-01
Included in the Prior Art Database: 2005-Jan-29
The cutting algorithm enables computation of bounds on signal probabilities and detection probabilities of faults in networks designed according to the level-sensitive scan design (LSSD) rules *. These bounds are used to determine the necessary pseudorandom test length needed to test a given product using built-in self test (BIST). One of the problems with the cutting algorithm is that is may compute loose bounds that translate into unnecessarily high test lengths. The object of this disclosure is to improve the cutting algorithm so that the computer bounds become satisfactory.