2009 Ieee Autotestcon 2009
DOI: 10.1109/autest.2009.5313996
|View full text |Cite
|
Sign up to set email alerts
|

Simplified metrics for evaluating designs for testability

Abstract: Design for Testability (DFT) evaluation is quite complex and circuit dependent. To simplify the analysis and to apply the methodology more generally to different circuit types and different levels of assembly, we focus our efforts on identifying areas of poor testability. We introduce metrics we call Sensitized Path Oriented Testability Scoring TM or SPOTS TM , performed at all points where failure modes are to be detected and diagnosed, to spot poor testability. Once the problem is identified early in the des… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(1 citation statement)
references
References 14 publications
0
1
0
Order By: Relevance
“…Methods of test point selection are widely used at present such as correlation modeling method, particle swarm method and so on. The simple correlation modeling method [3] makes diagnostic strategy by partitioning the correlation matrix [4] on the basis of having known the primarily chosen test point [5]. If we apply this method to the primary selection of test signals, the number of sub-matrix will grow at the speed of 2 p along with the times of partitioning due to much more candidate test signals, resulting in large amount of calculation.…”
Section: Introductionmentioning
confidence: 99%
“…Methods of test point selection are widely used at present such as correlation modeling method, particle swarm method and so on. The simple correlation modeling method [3] makes diagnostic strategy by partitioning the correlation matrix [4] on the basis of having known the primarily chosen test point [5]. If we apply this method to the primary selection of test signals, the number of sub-matrix will grow at the speed of 2 p along with the times of partitioning due to much more candidate test signals, resulting in large amount of calculation.…”
Section: Introductionmentioning
confidence: 99%