Bounding Signal Probabilities in Combinational Circuits
In  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.
G. Markowsky, "Bounding Signal Probabilities in Combinational Circuits," IEEE Transactions on Computers, vol. C-36, no. 10, pp. 1247-1251, Institute of Electrical and Electronics Engineers (IEEE), Oct 1987.
The definitive version is available at http://dx.doi.org/10.1109/TC.1987.1676866
Keywords and Phrases
Error Detection; Fault Detection; Random Testing; Signal Probability
International Standard Serial Number (ISSN)
Article - Journal
© 1987 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.