Altering a pseudo-random bit sequence for scan-based BIST

This paper presents a low-overhead scheme for the built-in self-test (BIST) of circuits with scan. Complete (100%) fault coverage is obtained without modifying the function logic and without degrading system performance (beyond using scan). Deterministic test cubes that detect the random-pattern-resistant faults are embedded in a pseudo-random sequence of bits generated by a linear feedback shift register (LFSR). This is accomplished by altering the pseudo-random 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. Also, the proposed approach permits the use of small LFSRs for generating the pseudo-random bit sequence. The faults that are not detected because of linear dependencies in the LFSR can be detected by embedding deterministic cubes at the expense of additional bit-fixing logic. Data is presented showing how much additional logic is required for different size LFSRs.

[1]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[2]  Eric Lindbloom,et al.  Random-Pattern Coverage Enhancement and Diagnosis for LSSD Logic Self-Test , 1983, IBM J. Res. Dev..

[3]  F. Brglez,et al.  A neutral netlist of 10 combinational benchmark circuits and a target translator in FORTRAN , 1985 .

[4]  Hans-Joachim Wunderlich,et al.  Multiple distributions for biased random test patterns , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[5]  Robert K. Brayton,et al.  Multi-level logic minimization using implicit don't cares , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[7]  Clay S. Gloster,et al.  Hardware-based weighted random pattern generation for boundary scan , 1989, Proceedings. 'Meeting the Tests of Time'., International Test Conference.

[8]  Gary D. Hachtel,et al.  BOLD: The Boulder Optimal Logic Design system , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume 1: Architecture Track.

[9]  Hans-Joachim Wunderlich Multiple distributions for biased random test patterns , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Benoit Nadeau-Dostie,et al.  A new procedure for weighted random built-in self-test , 1990, Proceedings. International Test Conference 1990.

[11]  B. Koenemann LFSR-coded test patterns for scan designs , 1991 .

[12]  GENERATION OF VECTOR PATTTERNS THROUGH RESEEDING OF MUETIPLE-POLYNOMIAL LINEAR FEEDBACK SHIFT REGIST , 1992, Proceedings International Test Conference 1992.

[13]  Janusz Rajski,et al.  The testability-preserving concurrent decomposition and factorization of Boolean expressions , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Bernard Courtois,et al.  Generation of Vector Patterns Through Reseeding of Multipe-Polynominal Linear Feedback Shift Registers , 1992 .

[15]  S. Hellebrand,et al.  An Efficient Bist Scheme Based On Reseeding Of Multiple Polynomial Linear Feedback Shift Registers , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[16]  B. Koneman,et al.  LFSR-Coded Test Patterns for Scan Designs , 1993 .

[17]  Chen-Huan Chiang,et al.  Random Pattern Testable Logic Synthesis , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[18]  Sandeep K. Gupta,et al.  Random pattern testable logic synthesis , 1994, ICCAD.

[19]  Nur A. Touba,et al.  Automated logic synthesis of random pattern testable circuits , 1994, Proceedings., International Test Conference.

[20]  Kwang-Ting Cheng,et al.  Timing-driven test point insertion for full-scan and partial-scan BIST , 1995, Proceedings of 1995 IEEE International Test Conference (ITC).

[21]  Nur A. Touba,et al.  Transformed pseudo-random patterns for BIST , 1995, Proceedings 13th IEEE VLSI Test Symposium.

[22]  Dhiraj K. Pradhan,et al.  LOT: logic optimization with testability—new transformations using recursive learning , 1995, ICCAD.

[23]  Pattern generation for a deterministic BIST scheme , 1995, ICCAD.

[24]  Dhiraj K. Pradhan,et al.  LOT: Logic optimization with testability - new transformations using recursive learning , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[25]  Bernard Courtois,et al.  Built-In Test for Circuits with Scan Based on Reseeding of Multiple-Polynomial Linear Feedback Shift Registers , 1995, IEEE Trans. Computers.

[26]  S. Hellebrand,et al.  Pattern generation for a deterministic BIST scheme , 1995, Proceedings of IEEE International Conference on Computer Aided Design (ICCAD).

[27]  Janusz Rajski,et al.  Decompression of test data using variable-length seed LFSRs , 1995, Proceedings 13th IEEE VLSI Test Symposium.

[28]  Nur A. Touba,et al.  Test point insertion based on path tracing , 1996, Proceedings of 14th VLSI Test Symposium.

[29]  Jack. Newville Paper 7 , 2019, RevMED.