Proceedings Seventh Asian Test Symposium (ATS'98) (Cat. No.98TB100259)
DOI: 10.1109/ats.1998.741650
|View full text |Cite
|
Sign up to set email alerts
|

A ring architecture strategy for BIST test pattern generation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(13 citation statements)
references
References 27 publications
0
13
0
Order By: Relevance
“…The test application time is compared with related BIST solutions without storage memories, as shown in the table, they contains paper [2], paper [9], paper [11] and paper [16]. The last column is the test application time and the hardware cost of ours where the hardware cost is measured by the number of gate they contain.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…The test application time is compared with related BIST solutions without storage memories, as shown in the table, they contains paper [2], paper [9], paper [11] and paper [16]. The last column is the test application time and the hardware cost of ours where the hardware cost is measured by the number of gate they contain.…”
Section: Resultsmentioning
confidence: 99%
“…However, because complex circuits often contains some hard-to-detect faults that random-pattern resistant, the conventional BIST often requires long test application time, and hard to achieve high fault coverage [1] .To solve these problems, many of techniques have been proposed. Test point insertion [2][3][4] , weighted pattern testing [5][6][7][8] , and reseeding [9][10][11] are three most popular logic BIST schemes.…”
Section: Introductionmentioning
confidence: 99%
“…Examples include the following: the design for testability technique [5,6] in which observation points are inserted in CUT and the number of rpr faults is reduced [7], the bit-fixed technique [8] in which specific logic values are fixed at reliable bit positions, the technique in which the initial values of counters are reseeded [9], and the TPG for BIST utilizing vector obtained by ATPG (hereafter called ATPG vectors) [10]. A technique for core-based LSIs has also been proposed [1].…”
Section: Introductionmentioning
confidence: 99%
“…One possible way to do this is to select the "seed" very carefully. Several procedures to select seeds have already been studied [16][17][18][19][20][21]. Bayraktaroglu et al examined the PRPG structure and selection approaches [16].…”
Section: Introductionmentioning
confidence: 99%
“…Lempel et al proposed an LFSR seed-selecting algorithm that used the theory of discrete logarithms [17]. The technique Fagot et al used [18] estimates test quality by using the Hamming distance between the testcube and the test pattern that is output from the LFSR for a bit-flipping BIST. In Fagot et al's later study [19], fault simulation computes an efficient LFSR seed which outputs the test sequence including a testcube.…”
Section: Introductionmentioning
confidence: 99%