RESTRICTED RANGE CUTTING ALGORITHM.

G. Ditlow, J. Savir

Research output: Contribution to journalArticlepeer-review

Abstract

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 languageEnglish (US)
Pages (from-to)2196-2201
Number of pages6
JournalIBM technical disclosure bulletin
Volume26
Issue number4
StatePublished - Jan 1 1983
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'RESTRICTED RANGE CUTTING ALGORITHM.'. Together they form a unique fingerprint.

Cite this