The cutting algorithm allows computation of bounds on signal probabilities and detection probabilities in combinational networks. These bounds can be used to determine the necessary pseudorandom test length needed to test a network. One of the problems with the cutting algorithm is that it may compute loose bounds which translate into unnecessarily long test lengths. The object of this paper is to improve the cutting algorithm so that the computed bounds become satisfactory. The improved cutting algorithm is a careful combination of the original cutting algorithm and the Parker-McCluskey algorithm. The tightness of the computed bounds may vary depending on which portion of the circuit is handled with the cutting algorithm and which with the Parker-McCluskey algorithm. Thus, the user of the improved cutting algorithm can actually control and trade off the accuracy of the results against the computational effort needed to achieve them.
|Original language||English (US)|
|Number of pages||8|
|Journal||IBM Journal of Research and Development|
|State||Published - Mar 1 1990|
All Science Journal Classification (ASJC) codes
- Computer Science(all)