1987
DOI: 10.1109/tc.1987.1676905
|View full text |Cite
|
Sign up to set email alerts
|

Pseudorandom Testing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
17
0

Year Published

1989
1989
2014
2014

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 145 publications
(17 citation statements)
references
References 6 publications
0
17
0
Order By: Relevance
“…These techniques are generally able to generate test patterns with a high fault coverage and an optimized length, but they suffer from long execution times. Random methods [187] produce test vectors as pseudorandomly generated n-tuples of input values, thus requiring no knowledge of circuit structure. Random methods generate test vectors more quickly than deterministic methods, but need a large number of vectors to ensure a high probability of detecting all faults.…”
Section: Related Work: Testing Techniquesmentioning
confidence: 99%
“…These techniques are generally able to generate test patterns with a high fault coverage and an optimized length, but they suffer from long execution times. Random methods [187] produce test vectors as pseudorandomly generated n-tuples of input values, thus requiring no knowledge of circuit structure. Random methods generate test vectors more quickly than deterministic methods, but need a large number of vectors to ensure a high probability of detecting all faults.…”
Section: Related Work: Testing Techniquesmentioning
confidence: 99%
“…Some efforts have analyzed the pseudo-random testing [10][11][12][13]. These efforts used the combinatorial analysis and the differential solution to obtain the detection probability, the input sequence length, the fault coverage, the test confidence, and so on.…”
Section: Introductionmentioning
confidence: 99%
“…Analytical and approximate testability analysis of circuits for static stuck-at type fault models have been widely discussed [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21]. These analytical and approximate methods estimate probabilities and detectabilities for non-redundant combinational circuits as well as general combinational circuits.…”
Section: Introductionmentioning
confidence: 99%