2010
DOI: 10.1007/s10836-010-5142-2
|View full text |Cite
|
Sign up to set email alerts
|

Search State Compatibility Based Incremental Learning Framework and Output Deviation Based X-filling for Diagnostic Test Generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 27 publications
0
4
0
Order By: Relevance
“…For each fault pair, we add a constraint to ensure that at least one of the faults is excited. In the running example, if fault f 1 is injected in the 4 th copy of the circuit and fault f 2 is injected in the 6 th copy of the circuit, then the excitation constraint added will be g1 [4] = 1 || g2 [6] = 0…”
Section: B Excitation Constraintmentioning
confidence: 99%
See 1 more Smart Citation
“…For each fault pair, we add a constraint to ensure that at least one of the faults is excited. In the running example, if fault f 1 is injected in the 4 th copy of the circuit and fault f 2 is injected in the 6 th copy of the circuit, then the excitation constraint added will be g1 [4] = 1 || g2 [6] = 0…”
Section: B Excitation Constraintmentioning
confidence: 99%
“…of faults. In [6], an incremental learning-based ADPG flow was proposed which incrementally utilized the information learned during ATPG for ADPG. An output dependent approach for diagnostic test generation was proposed in [7] in which outputs of the circuit are considered one at a time.…”
Section: Introductionmentioning
confidence: 99%
“…These ‗X' bits can also be filled to increase the diagnostic ability of the test set. References [6], [9][10][11] provide X-filling algorithms for diagnosis purposes. In [6] and [9] authors have used the test sets with ‗X' bits to maximize the diagnostic power of the test set by applying ‗X' bit filling algorithms to maximize the metric proposed in [6].…”
Section: Introductionmentioning
confidence: 99%
“…In [6] authors have proposed a simple FS (Flip-Select heuristic) for ‗X' bit filling. The work [9] proposes a GA (genetic Algorithm) for ‗X' bit filling and also it has been shown that the performance of these filling techniques are superior to the methods proposed in [10] and [11].…”
Section: Introductionmentioning
confidence: 99%