A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume

Wei Cheng Lien, Kuen-Jong Lee, Tong Yu Hsieh

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

This paper proposes a new test-per-clock BIST method that attempts to minimize the test sequence length and the test data volume simultaneously. An efficient LFSR reseeding algorithm is developed by which each determined seed together with its derived patterns can detect the maximum number of so far undetected faults. During the seed determination process an adaptive X-filling process is first employed to generate a set of candidate patterns for pattern embedding. The process then derives a seed solution that can embed multiple candidate patterns at one time so as to minimize the number of seeds. To shorten the test sequence, the pattern embedding process begins with a small initial set of pseudo-random patterns and will incrementally add more patterns only when necessary. Experimental results show that compared with the previous test-per-clock techniques based on the LFSR- and twisted-ring-counter-reseeding methods, our method can reduce the test sequence length by over 60% with generally smaller numbers of storage bits. When compared with the mapping-logic-based BIST methods, our method can reduce the test sequence length by over 50% with a comparable area overhead.

Original languageEnglish
Title of host publicationProceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012
Pages278-283
Number of pages6
DOIs
Publication statusPublished - 2012 Dec 1
Event2012 IEEE 21st Asian Test Symposium, ATS 2012 - Niigatta, Japan
Duration: 2012 Nov 192012 Nov 22

Publication series

NameProceedings of the Asian Test Symposium
ISSN (Print)1081-7735

Other

Other2012 IEEE 21st Asian Test Symposium, ATS 2012
CountryJapan
CityNiigatta
Period12-11-1912-11-22

Fingerprint

Seed
Clocks
Built-in self test

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Lien, W. C., Lee, K-J., & Hsieh, T. Y. (2012). A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume. In Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012 (pp. 278-283). [6394216] (Proceedings of the Asian Test Symposium). https://doi.org/10.1109/ATS.2012.11
Lien, Wei Cheng ; Lee, Kuen-Jong ; Hsieh, Tong Yu. / A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume. Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012. 2012. pp. 278-283 (Proceedings of the Asian Test Symposium).
@inproceedings{5a3b489b87364ab29bb82709bd78f7e0,
title = "A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume",
abstract = "This paper proposes a new test-per-clock BIST method that attempts to minimize the test sequence length and the test data volume simultaneously. An efficient LFSR reseeding algorithm is developed by which each determined seed together with its derived patterns can detect the maximum number of so far undetected faults. During the seed determination process an adaptive X-filling process is first employed to generate a set of candidate patterns for pattern embedding. The process then derives a seed solution that can embed multiple candidate patterns at one time so as to minimize the number of seeds. To shorten the test sequence, the pattern embedding process begins with a small initial set of pseudo-random patterns and will incrementally add more patterns only when necessary. Experimental results show that compared with the previous test-per-clock techniques based on the LFSR- and twisted-ring-counter-reseeding methods, our method can reduce the test sequence length by over 60{\%} with generally smaller numbers of storage bits. When compared with the mapping-logic-based BIST methods, our method can reduce the test sequence length by over 50{\%} with a comparable area overhead.",
author = "Lien, {Wei Cheng} and Kuen-Jong Lee and Hsieh, {Tong Yu}",
year = "2012",
month = "12",
day = "1",
doi = "10.1109/ATS.2012.11",
language = "English",
isbn = "9780769548760",
series = "Proceedings of the Asian Test Symposium",
pages = "278--283",
booktitle = "Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012",

}

Lien, WC, Lee, K-J & Hsieh, TY 2012, A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume. in Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012., 6394216, Proceedings of the Asian Test Symposium, pp. 278-283, 2012 IEEE 21st Asian Test Symposium, ATS 2012, Niigatta, Japan, 12-11-19. https://doi.org/10.1109/ATS.2012.11

A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume. / Lien, Wei Cheng; Lee, Kuen-Jong; Hsieh, Tong Yu.

Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012. 2012. p. 278-283 6394216 (Proceedings of the Asian Test Symposium).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume

AU - Lien, Wei Cheng

AU - Lee, Kuen-Jong

AU - Hsieh, Tong Yu

PY - 2012/12/1

Y1 - 2012/12/1

N2 - This paper proposes a new test-per-clock BIST method that attempts to minimize the test sequence length and the test data volume simultaneously. An efficient LFSR reseeding algorithm is developed by which each determined seed together with its derived patterns can detect the maximum number of so far undetected faults. During the seed determination process an adaptive X-filling process is first employed to generate a set of candidate patterns for pattern embedding. The process then derives a seed solution that can embed multiple candidate patterns at one time so as to minimize the number of seeds. To shorten the test sequence, the pattern embedding process begins with a small initial set of pseudo-random patterns and will incrementally add more patterns only when necessary. Experimental results show that compared with the previous test-per-clock techniques based on the LFSR- and twisted-ring-counter-reseeding methods, our method can reduce the test sequence length by over 60% with generally smaller numbers of storage bits. When compared with the mapping-logic-based BIST methods, our method can reduce the test sequence length by over 50% with a comparable area overhead.

AB - This paper proposes a new test-per-clock BIST method that attempts to minimize the test sequence length and the test data volume simultaneously. An efficient LFSR reseeding algorithm is developed by which each determined seed together with its derived patterns can detect the maximum number of so far undetected faults. During the seed determination process an adaptive X-filling process is first employed to generate a set of candidate patterns for pattern embedding. The process then derives a seed solution that can embed multiple candidate patterns at one time so as to minimize the number of seeds. To shorten the test sequence, the pattern embedding process begins with a small initial set of pseudo-random patterns and will incrementally add more patterns only when necessary. Experimental results show that compared with the previous test-per-clock techniques based on the LFSR- and twisted-ring-counter-reseeding methods, our method can reduce the test sequence length by over 60% with generally smaller numbers of storage bits. When compared with the mapping-logic-based BIST methods, our method can reduce the test sequence length by over 50% with a comparable area overhead.

UR - http://www.scopus.com/inward/record.url?scp=84872572789&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84872572789&partnerID=8YFLogxK

U2 - 10.1109/ATS.2012.11

DO - 10.1109/ATS.2012.11

M3 - Conference contribution

AN - SCOPUS:84872572789

SN - 9780769548760

T3 - Proceedings of the Asian Test Symposium

SP - 278

EP - 283

BT - Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012

ER -

Lien WC, Lee K-J, Hsieh TY. A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume. In Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012. 2012. p. 278-283. 6394216. (Proceedings of the Asian Test Symposium). https://doi.org/10.1109/ATS.2012.11