Preanalysis for the Full Range Cutting Algorithm
Original Publication Date: 1984-Dec-01
Included in the Prior Art Database: 2005-Feb-05
This article describes a technique which may be used to collect the information necessary to perform the full range cutting algorithm. The cutting algorithm is a means of bounding the signal probability and detection probability of faults in a combinational circuit. It allows an early identification of "hard to detect faults", and indicates where a circuit modification is required in order to meet a given test quality specification. There are two versions of the cutting algorithm: the full range, and the partial range. The difference between the two is that the full range is using intervals of [0,1], while the partial range is using shorter intervals. In order to perform the full range cutting algorithm, we have to collect the following information: (1) Identify the tree, and nontree lines.