Bit-fixing in pseudorandom sequences for scan BIST

被引:69
|
作者
Touba, NA
McCluskey, EJ
机构
[1] Stanford Univ, Dept Elect Engn, Ctr Reliabil Comp, Stanford, CA 94305 USA
[2] Stanford Univ, Dept Comp Sci, Ctr Reliabil Comp, Stanford, CA 94305 USA
基金
美国国家科学基金会;
关键词
design for testability; digital system testing; logic circuit testing; self-testing; sequences;
D O I
10.1109/43.918212
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A low-overhead scheme for achieving complete (100%) fault coverage during built-in self test of circuits with scan is presented. It does not require modifying the function logic and does not degrade system performance (beyond using scan). Deterministic test cubes that detect the random-pattern-resistant (cp,c) faults are embedded in a pseudorandom sequence of bits generated by a linear feedback shift register (LFSR). This is accomplished by altering the pseudorandom sequence by adding logic at the LFSR's serial output to "fix" certain bits. A procedure for synthesizing the bit-fixing logic for embedding the test cubes is described. Experimental results indicate that complete fault coverage can be obtained with low hardware overhead. Further reduction in overhead is possible by using a special correlating automatic test pattern generation procedure that is described for finding test cubes for the r.p.r. faults in a way that maximizes bitwise correlation.
引用
收藏
页码:545 / 555
页数:11
相关论文
共 50 条
  • [1] A scan BIST generation method using a Markov source and partial bit-fixing
    Wei, L
    Yu, CW
    Reddy, SM
    Pomeranz, I
    40TH DESIGN AUTOMATION CONFERENCE, PROCEEDINGS 2003, 2003, : 554 - 559
  • [2] Bit-fixing Codes for Multi-level Cells
    Jiang, Anxiao
    Li, Yue
    Bruck, Jehoshua
    2012 IEEE INFORMATION THEORY WORKSHOP (ITW), 2012, : 252 - 256
  • [3] Deterministic extractors for bit-fixing sources by obtaining an independent seed
    Gabizon, Ariel
    Raz, Ran
    Shaltiel, Ronen
    SIAM JOURNAL ON COMPUTING, 2006, 36 (04) : 1072 - 1094
  • [4] Deterministic extractors for bit-fixing sources by obtaining an independent seed
    Gabizon, A
    Raz, R
    Shaltiel, R
    45TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2004, : 394 - 403
  • [5] Reducing Depth in Constrained PRFs: From Bit-Fixing to NC
    Chandran, Nishanth
    Raghuraman, Srinivasan
    Vinayagamurthy, Dhinakaran
    PUBLIC-KEY CRYPTOGRAPHY - PKC 2016, PT II, 2016, 9615 : 359 - 385
  • [6] Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
    Kamp, Jesse
    Zuckerman, David
    SIAM JOURNAL ON COMPUTING, 2006, 36 (05) : 1231 - 1247
  • [7] Deterministic extractors for bit-fixing sources and exposure-resilient cryptography
    Kamp, J
    Zuckerman, D
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 92 - 101
  • [8] Randomness Analysis of Pseudorandom Bit Sequences
    Kadir, Rashidah
    Maarof, Mohd Aizaini
    PROCEEDINGS OF 2009 INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND APPLICATIONS, 2009, : 445 - 449
  • [9] Pseudorandom scan BIST using improved test point insertion techniques
    Chen, MJ
    Xiang, D
    2004: 7TH INTERNATIONAL CONFERENCE ON SOLID-STATE AND INTEGRATED CIRCUITS TECHNOLOGY, VOLS 1- 3, PROCEEDINGS, 2004, : 2043 - 2046
  • [10] A Comparative Statistical Analysis of Pseudorandom Bit Sequences
    Kadir, Rashidah
    Maarof, Mohd Aizaini
    FIFTH INTERNATIONAL CONFERENCE ON INFORMATION ASSURANCE AND SECURITY, VOL 2, PROCEEDINGS, 2009, : 91 - 94