2014 14th Biennial Baltic Electronic Conference (BEC) 2014
DOI: 10.1109/bec.2014.7320567
|View full text |Cite
|
Sign up to set email alerts
|

Comparison of two approaches to improve functional BIST fault coverage

Abstract: Two approaches to improve the fault coverage of functional logic BIST in digital circuits are proposed and investigated. The first approach is based on introducing of additional test points. An experimental tool set is developed for fast evaluation of the number of control points that is needed to achieve 100% fault coverage for the given functional test sequence. A novel algorithm is proposed to minimize the number of control points. The second approach is based on complementing the functional test with addit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2016
2016

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 23 publications
0
1
0
Order By: Relevance
“…To minimize the number of control points we apply the method described in [11]. By fault simulation of the given sequence of test patterns T we will determine the subsets of nodes S(k) in the circuit, where k means that for each node s∈S(k) the fault at this node is detected k or less times during the test T. If k = 0 then the fault is undetectable by T. If k > 0, but still very small, then the probability of testing the faults at the output branches of the gate is expected to be the smaller, the smaller is k. This consideration suggests to include into the set of candidate nodes for insertion of control points not only the nodes of S(0), but all the nodes of S(k*) where the value of k* can be predetermined.…”
Section: Fig 7 a Combinational Circuit Redesign For Better Testabilitymentioning
confidence: 99%
“…To minimize the number of control points we apply the method described in [11]. By fault simulation of the given sequence of test patterns T we will determine the subsets of nodes S(k) in the circuit, where k means that for each node s∈S(k) the fault at this node is detected k or less times during the test T. If k = 0 then the fault is undetectable by T. If k > 0, but still very small, then the probability of testing the faults at the output branches of the gate is expected to be the smaller, the smaller is k. This consideration suggests to include into the set of candidate nodes for insertion of control points not only the nodes of S(0), but all the nodes of S(k*) where the value of k* can be predetermined.…”
Section: Fig 7 a Combinational Circuit Redesign For Better Testabilitymentioning
confidence: 99%