Bounding Signal Probabilities in Combinational Circuits

Markowsky

IEEE Transactions on Computers · 1987 · 15 citations · 3 references

Concepts

Abstract

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.

References

3