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 left bracket 0, 1 right bracket , while the partial range is using shorter intervals.
|Original language||English (US)|
|Number of pages||4|
|Journal||IBM technical disclosure bulletin|
|Issue number||7 A|
|State||Published - Dec 1 1984|
All Science Journal Classification (ASJC) codes