European Test Workshop 1999 (Cat. No.PR00390)
DOI: 10.1109/etw.1999.803819
|View full text |Cite
|
Sign up to set email alerts
|

On calculating efficient LFSR seeds for built-in self test

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 43 publications
(11 citation statements)
references
References 16 publications
0
11
0
Order By: Relevance
“…Moreover, mixed-mode BIST is related to a specific fault model. Pseudo-random BIST consists in applying test patterns that exhibit randomness but which are generated using special-purpose hardware (LFSR or Cellular Automata) and are thus repeatable [9,10,11]. Pseudo-random BIST is the least hardware consuming solution but requires test lengths which may be long in some cases.…”
Section: Introductionmentioning
confidence: 99%
“…Moreover, mixed-mode BIST is related to a specific fault model. Pseudo-random BIST consists in applying test patterns that exhibit randomness but which are generated using special-purpose hardware (LFSR or Cellular Automata) and are thus repeatable [9,10,11]. Pseudo-random BIST is the least hardware consuming solution but requires test lengths which may be long in some cases.…”
Section: Introductionmentioning
confidence: 99%
“…Two aspects play role here: the LFSR polynomial and seed and the test length. Several methods to compute the LFSR seed to achieve good fault coverage have been proposed [12,13]. However, for simplicity, we just repeatedly select the seed randomly, evaluate the fault coverage reached by using it, and select the best one.…”
Section: Pseudo-random Phasementioning
confidence: 99%
“…The general problem of circuit-specific customization of pseudo-random sequence generators has been vigorously studied for the last twenty years. Proposed solutions involve reseeding of LFSR [2,3,4,5,6,7,8,9,10], weighted random-pattern generation (WRPG) [11,12,13,14,15,16], and embedding of deterministic patterns in the pseudo-random sequence by using bitfixing or bit-flipping logic, sometimes in combination with Markov sources [17,18,19,20]. Along this spectrum of approaches, our contribution falls under WRPG because the 0, 1, and x values in a cube can be mapped to the very simple weight set, {0, 1, 0.5}.…”
Section: (Test Compaction Problem)mentioning
confidence: 99%