Fault Coverage Estimation for Non-Random Functional Input Sequences
S. Bose,Vishwani D. Agrawal +1 more
- 01 Oct 2006
- pp 1-10
TL;DR: A significantly improved coverage estimation algorithm is presented, modified in order to eliminate the non-random biasing of the input sequence and estimate the detection probabilities of the remaining faults.
read more
Abstract: Statistical stuck-at fault coverage estimation assumes that signals at primary inputs and at other internal gates of the circuit are statistically independent. While valid for random and pseudo-random inputs, this causes substantial errors in coverage estimation for input sequences that are functional and not random, as shown by experimental data presented in this paper. At internal gates, signal correlation due to fanout reconvergence, even for random input sequences, contributes to errors. A significantly improved coverage estimation algorithm is presented in this paper. First, during logic simulation we identify faults that are guaranteed to stay undetected by the applied vectors. Then, after logic simulation, we estimate the detection probabilities of the remaining faults. Compared to Stafan, the statistics gathered during logic simulation are modified in order to eliminate the non-random biasing of the input sequence. Besides the improved detection probabilities, a newly defined effective length (Neff) of the vector sequence corrects for the temporally correlated signals. Experimental results for ISCAS combinational benchmarks demonstrate validity of this approach
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures

Table 1: Identical coverage vector sets of varying lengths. 
Figure 6: Example estimation for large design. 
Table 5: Signal monitoring result after second vector. 
Figure 1: Illustrating Stafan with biased inputs. 
Table 6: Observabilities after second vector. ![Figure 5: Exact, upper bound [2], and statistical coverages of c2670 by a long deterministic sequence.](/figures/figure-5-exact-upper-bound-2-and-statistical-coverages-of-23rpo2tg.png)
Figure 5: Exact, upper bound [2], and statistical coverages of c2670 by a long deterministic sequence.
Citations
Estimating Stuck Fault Coverage in Sequential Logic Using State
S. Bose,Vishwani D. Agrawal +1 more
- 01 Jan 2007
TL;DR: This paper proposes an entropy based technique that collapses the state graph to be analyzed and shows how a simple state traversal analysis can mitigate stuck fault coverage estimation error.
Estimating stuck fault coverage in sequential logic using state traversal and entropy analysis
S. Bose,Vishwani D. Agrawal +1 more
- 01 Oct 2007
TL;DR: In this paper, a simple state traversal analysis is proposed to mitigate the problem of stuck fault coverage estimation for sequential circuits, where combinational techniques are employed for each time-frame.
References
•Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
- 01 Jan 1974
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
10.6K
•Book
Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI Circuits
Michael L. Bushnell,Vishwani D. Agrawal +1 more
- 07 Apr 2013
TL;DR: This book provides a careful selection of essential topics on all three types of circuits, namely, digital, memory, and mixed-signal, each requiring different test and design for testability methods.
1.6K
Concurrent simulation of nearly identical digital networks
E. G. Ulrich,T. Baker +1 more
TL;DR: Test patterns for testing digital circuits are usually checked on a test verification program to determine if all or most of the possible faults will be detected.
277
PROOFS: a fast, memory-efficient sequential circuit fault simulator
TL;DR: The authors describe PROOFS, a fast fault simulator for synchronous sequential circuits that achieves high performance by combining all the advantages of differential fault simulation, single fault propagation, and parallel fault simulation while minimizing their individual disadvantages.
235
PROOFS: a fast, memory efficient sequential circuit fault simulator
Thomas M. Niermann,Wu-Tung Cheng,Janak H. Patel +2 more
- 24 Jun 1990
TL;DR: This paper describes PROOFS, a super fast fault simulator for synchronous sequential circuits that minimizes the memory requirements, reduces the number of events that need to be evaluated, and simplifies the complexity of the software implementation.
195
Related Papers (5)
K. Heragu,Vishwani D. Agrawal,Michael L. Bushnell +2 more
- 01 May 1995
Sunil K. Jain,Vishwani D. Agrawal +1 more
- 25 Jun 1984