Subscribe

Issue No.11 - November (1990 vol.39)

pp: 1369-1377

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.61046

ABSTRACT

<p>Algorithms for the following two problems are presented: (1) computing detection probability of stuck-at faults (CDP), and (2) computing signal probability (CSP). These problems arise in the context of random testing, pseudorandom testing, and testability analysis of combinational circuits. The algorithm for CDP combines the notion of supergates and a refinement of th algorithm for CDP presented in the work of S. Chakravarty and H.B. Hunt, III (1986). The algorithm for CDP can be used to compute the exact value of detection probability of multiple stuck-at faults in circuits with multiple outputs. Single-input, single-output pseudo gates are inserted to model stuck-at faults and derive an equivalent single-output circuit. CDP is thus reduced to the problem of computing the probability distribution of the output over the set of four logic values (0, 1d, d). The algorithm for CDP uses an efficient enumeration algorithm. The authors show how the enumeration algorithm can be used to refine the algorithm for CSP.</p>

INDEX TERMS

signal probability; detection probability; stuck-at faults; random testing; pseudorandom testing; testability analysis; combinational circuits; pseudo gates; enumeration algorithm; built-in self test; combinatorial circuits; logic testing.

CITATION

S. Chakravarty, H.B. Hunt, III, "On Computing Signal Probability and Detection Probability of Stuck-At Faults",

*IEEE Transactions on Computers*, vol.39, no. 11, pp. 1369-1377, November 1990, doi:10.1109/12.61046