It is pointed out how to take advantage of the inversion parity of the reconvergent fanout branches to compute tighter bounds of signal probabilities in the use of cutting algorithms for circuit design test. It is shown that in some cases it is possible to assign one of the ranges (O,g) or (g,1) to the cut fanout branch, where g is the signal probability of the stem of the fanout. If g is in itself a range (l,u), then one of the ranges (O,u) or (l,1) will be assigned.
|Original language||English (US)|
|Number of pages||6|
|Journal||IBM technical disclosure bulletin|
|State||Published - Jan 1 1983|
All Science Journal Classification (ASJC) codes