DocumentCode :
1154563
Title :
Bounding Signal Probabilities in Combinational Circuits
Author :
Markowsky, George
Author_Institution :
Department of Computer Science, University of Maine
Issue :
10
fYear :
1987
Firstpage :
1247
Lastpage :
1251
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 :
Error detection; fault detection; random testing; signal probability; Books; Circuit testing; Combinational circuits; Computer science; Electrical fault detection; Fault detection; Ink; Inverters; Signal detection; Upper bound; Error detection; fault detection; random testing; signal probability;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1987.1676866
Filename :
1676866
Link To Document :
بازگشت