Browse Prior Art Database

Restricted Range Cutting Algorithm

IP.com Disclosure Number: IPCOM000047138D
Original Publication Date: 1983-Sep-01
Included in the Prior Art Database: 2005-Feb-07

Publishing Venue

IBM

Related People

Authors:
Ditlow, G Savir, J [+details]

Abstract

This publication describes 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 (0,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 (P,u), then one of the ranges (0,u) or (P,1) will be assigned. Theorem 1: te fanout stem with signal probability g, from which only one pair of reconverging paths emanates. Let this pair of reconverging paths be the only one in the network. Let H be the gate through which the pair of paths reconverges. Let h be the output of this gate.