Fault Detection Probability Evaluation Approach in Combinational Circuits Using Test Set Generation Method

@inproceedings{Arya2018FaultDP,
  title={Fault Detection Probability Evaluation Approach in Combinational Circuits Using Test Set Generation Method},
  author={Namita Arya and Amit Prakash Singh},
  year={2018}
}
This paper introduces an approach that chooses the fault detection by calculating probabilities using probability mass function (pmf) and cumulative distribution function (CDF). This work used a method for multiple stuck-at faults by producing a new test pattern in combinational circuits. We assumed that existence of all multiple faults is only because of one single component that is faulty. A complete test set can be created by all possible single stuck-at faults in a combinational circuit… 

Tables from this paper

References

SHOWING 1-10 OF 27 REFERENCES
A generalized algorithm for bounding fault detection probabilities in combinational circuits
  • R. Pathak
  • Computer Science, Engineering
    AUTOTESTCON 93
  • 1993
TLDR
An algorithm for computing bounds for the fault detection probabilities in linear time and which requires almost no memory is introduced.
Bounding fault detection probabilities in combinational circuits
TLDR
Two algorithms are presented that always produce true lower bounds on the detection probability of a fault, both of which resulted from research in trying to determine the accuracy of the safety factor heuristic of Jacob Savir.
Incremental computation of delay fault detection probability for variation-aware test generation
TLDR
This paper presents the first incremental delay fault detection probability computation algorithm in the literature, suitable for the inner loop of automatic test pattern generation methods, which consistently shows a very large speedup and only a small approximation error.
Techniques for estimating test length under random test
TLDR
A methodology for predicting different statistics of random pattern test length is presented, capable of providing estimates of all statistics of interest (including expected value and variance) for all coverage specifications.
Two-test two-function technique for fault detection in digital combinational circuits
A test method is proposed for detecting single and multiple faults in digital combinational circuits. The method requires only two test input combinations. An additional output is generated such that…
Multiple stuck-at fault testability of self-testing checkers
  • T. Nanya, S. Mourad, E. McCluskey
  • Computer Science
    [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers
  • 1988
TLDR
It is shown by simulation experiments that codeword testing can detect more than 99% of all possible double and triple faults in existing self-testing checkers for two-rail codes, Berger codes, and k-out-of-2k codes.
Multiple Fault Testing of Large Circuits by Single Fault Test Sets
TLDR
A general theory is presented to quantitatively predict the multiple fault coverage capability of single fault detection test sets in combinational circuits and its predictions made for reconvergent internal fan-out circuits are seen.
Compact test sets for high defect coverage
TLDR
This work reports on test pattern generators for combinational circuits that generate test sets to detect each single line stuck-at fault a given number of times, and shows that the defect coverage does not have to be sacrificed by test compaction if the test set is computed using appropriate test generation objectives.
A partitioning technique for reducing the computational complexity of probabilistic fault detection in general combinational circuits
TLDR
It will be shown that decomposing a general combinational circuit into its modules (supergates) such that these modules constitute the basic elements of a tree circuit (network) considerably reduces the computational complexity of the fault detection probability problem.
...
1
2
3
...