Article
Bounding Signal Probabilities in Combinational Circuits
IEEE Transactions on Computers
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.
Department(s)
Computer Science
Keywords and Phrases
- Error Detection,
- Fault Detection,
- Random Testing,
- Signal Probability
Document Type
Article - Journal
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 1987 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.
Publication Date
10-1-1987
Publication Date
01 Oct 1987
Disciplines
Citation Information
George Markowsky. "Bounding Signal Probabilities in Combinational Circuits" IEEE Transactions on Computers Vol. C-36 Iss. 10 (1987) p. 1247 - 1251 ISSN: 0018-9340 Available at: http://works.bepress.com/george-markowsky/15/