Bounding Signal Probabilities in Combinational Circuits

1 October 1987

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-36 (10) , 1247-1251
https://doi.org/10.1109/TC.1987.1676866

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.

Keywords

FAN
SIGNAL PROBABILITY
COMBINATIONAL CIRCUITS
ESTIMATING THE SIGNAL
RECONVERGENT
ESTIMATE SIGNAL PROBABILITIES
SIGNAL PROBABILITIES IN ALL LINES
PROBABILITY OF A LINE

This publication has 1 reference indexed in Scilit:

Random Pattern Testability
IEEE Transactions on Computers, 1984