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

A BIST pattern generator design for near-perfect fault coverage

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
17
0
1

Year Published

2005
2005
2013
2013

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 36 publications
(18 citation statements)
references
References 35 publications
0
17
0
1
Order By: Relevance
“…However, the method can be modified for a test-per-scan as well [3]. Multiplexers separating combinational parts of sequential circuits have to be present, similarly like in full-scan designs.…”
Section: Proposed Test Pattern Generator Design Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…However, the method can be modified for a test-per-scan as well [3]. Multiplexers separating combinational parts of sequential circuits have to be present, similarly like in full-scan designs.…”
Section: Proposed Test Pattern Generator Design Methodsmentioning
confidence: 99%
“…The proposed column-catching method is compared with three state-of-the-art methods in this section, namely the bit-fixing accompanied by a "bit-correlating" ATPG [2], the "3-weight weighted random pattern BIST" proposed in [19] and the row matching method proposed in [3]. The comparison results are shown in Tab.…”
Section: Comparison With Other State-of-the-art Methodsmentioning
confidence: 99%
See 1 more Smart Citation
“…This is crucial to the quality component of testing. Chatterjee and Pradhan (2003) discussed that stored pattern BIST, requires high hardware overhead due to memory devices is in need to store pre computed test patterns, pseudorandom BIST, where test patterns are generated by pseudorandom pattern generators such as Linear Feedback Shift Registers (LFSRs) and Cellular Automata (CA), required very little hardware overhead. However, achieving high fault coverage for CUTs that contain many Random Pattern Resistant Faults (RPRFs) only with (pseudo) random patterns generated by an LFSR or CA often requires unacceptably long test sequences thereby resulting in prohibitively long test time.…”
Section: Introductionmentioning
confidence: 99%
“…Such an approach is exploited in the bit-fixing method [9,10], bit-flipping [11] and the method proposed in [12,13]. A similar principle is exploited in our column-matching method [14,15] as well.…”
Section: Introductionmentioning
confidence: 99%