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 条
  • [41] Pseudorandom Bit Generator with Parallel Implementation
    Stoyanov, Borislav
    Kordov, Krasimir
    LARGE-SCALE SCIENTIFIC COMPUTING, LSSC 2013, 2014, 8353 : 557 - 564
  • [42] Pseudorandom sequences derived from automatic sequences
    László Mérai
    Arne Winterhof
    Cryptography and Communications, 2022, 14 : 783 - 815
  • [43] Diagnosis of scan cells in BIST environment
    Rajski, J
    Tyszer, J
    IEEE TRANSACTIONS ON COMPUTERS, 1999, 48 (07) : 724 - 731
  • [44] Deterministic BIST with Multiple Scan Chains
    Gundolf Kiefer
    Hans-Joachim Wunderlich
    Journal of Electronic Testing, 1999, 14 : 85 - 93
  • [45] Logic BIST with scan chain segmentation
    Lai, LY
    Patel, JH
    Rinderknecht, T
    Cheng, WT
    INTERNATIONAL TEST CONFERENCE 2004, PROCEEDINGS, 2004, : 57 - 66
  • [46] Concatenation of pseudorandom binary sequences
    Gyarmati, Katalin
    PERIODICA MATHEMATICA HUNGARICA, 2009, 58 (01) : 99 - 120
  • [47] ON SOME TYPES OF PSEUDORANDOM SEQUENCES
    KRAMOSIL, I
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 476 - 483
  • [48] PARALLEL GENERATION OF PSEUDORANDOM SEQUENCES
    SAFAVINAINI, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 453 : 176 - 193
  • [49] Pseudorandom sequences of binary vectors
    Niederreiter, Harald
    Rivat, Joel
    Sarkozy, Andras
    ACTA ARITHMETICA, 2008, 133 (02) : 109 - 125
  • [50] ON THE NOTION OF INFINITE PSEUDORANDOM SEQUENCES
    KO, KI
    THEORETICAL COMPUTER SCIENCE, 1986, 48 (01) : 9 - 33