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

研究成果: Conference contribution

14 引文 斯高帕斯(Scopus)

摘要

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.

原文English
主出版物標題Proceedings - 2012 IEEE 21st Asian Test Symposium, ATS 2012
頁面278-283
頁數6
DOIs
出版狀態Published - 2012 十二月 1
事件2012 IEEE 21st Asian Test Symposium, ATS 2012 - Niigatta, Japan
持續時間: 2012 十一月 192012 十一月 22

出版系列

名字Proceedings of the Asian Test Symposium
ISSN(列印)1081-7735

Other

Other2012 IEEE 21st Asian Test Symposium, ATS 2012
國家/地區Japan
城市Niigatta
期間12-11-1912-11-22

All Science Journal Classification (ASJC) codes

  • 電氣與電子工程

指紋

深入研究「A test-per-clock LFSR reseeding algorithm for concurrent reduction on test sequence length and test data volume」主題。共同形成了獨特的指紋。

引用此