2000
DOI: 10.1016/s0218-1266(00)00008-1
|View full text |Cite
|
Sign up to set email alerts
|

Novel Test Generation Algorithm for Combination Circuits

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…Even though the dependence on the circuit inputs makes it impossible to predict the introduced latency, we stress that, assuming random inputs, the proposed method checks for faults every time an input / previous state combination that is a selected test vector appears. Empirical observations, as well as some theoretical analysis [12], indicate that, for random next state prediction logic, the ratio of such input / previous state combinations over all possible input combinations is significant. Additionally, we may reasonably assume that most "stuck-at" faults are detected by many input / previous state combinations.…”
Section: Discussionmentioning
confidence: 99%
“…Even though the dependence on the circuit inputs makes it impossible to predict the introduced latency, we stress that, assuming random inputs, the proposed method checks for faults every time an input / previous state combination that is a selected test vector appears. Empirical observations, as well as some theoretical analysis [12], indicate that, for random next state prediction logic, the ratio of such input / previous state combinations over all possible input combinations is significant. Additionally, we may reasonably assume that most "stuck-at" faults are detected by many input / previous state combinations.…”
Section: Discussionmentioning
confidence: 99%