Bounding Signal Probabilities in Combinational Circuits

In [2] Savir, Ditlow, and Bardell presented an algorithm for estimating the signal probability of a line in combinational circuits, but were unable to show that the algorithm always produced correct results. This paper shows that their algorithm for cutting reconvergent fan-out lines in a circuit eventually produces a circuit without reconvergent fan- out that can be used to estimate signal probabilities in all lines of the original circuit.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[2]  Gary S. Ditlow,et al.  Random Pattern Testability , 1984, IEEE Transactions on Computers.