Gauss-elimination-based generation of multiple seed-polynomial pairs for LFSR

This paper presents a new and efficient strategy of pseudorandom pattern generation (PRPG) for IC testing. It uses a general programmable LFSR (P-LFSR) to offer multiple-seed and multiple-polynomial PRPG. The deterministic pattern set generated by an ATPG tool or supplied by the designers is used to guide the generation of pseudorandom patterns. A novel application of the Gauss-elimination procedure is proposed to find the seeds as well as the polynomials. With an intelligent heuristic to further utilize the essential faults, this approach becomes very efficient, even for the random pattern resistant (RPR) circuits. Experiments are conducted on the ISCAS-85 benchmarks and the full scan version of the ISCAS-89 benchmarks. For all benchmark circuits, complete fault coverage is achieved with good balance on the hardware overhead and the test lengths as compared to other schemes.

[1]  Jau-Shien Chang,et al.  Test set compaction for combinational circuits , 1992, Proceedings First Asian Test Symposium (ATS `92).

[2]  Bozena Kaminska,et al.  A Deterministic Built-In-Self-Test Generator Based on Cellular Automata Structures , 1995, IEEE Trans. Computers.

[3]  M. Greenberg.  Advanced Engineering Mathematics , 1988 .

[4]  Hugo De Man,et al.  Cellular automata based deterministic self-test strategies for programmable data paths , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[5]  Wilfried Daehn,et al.  Accelerated test pattern generation by cone-oriented circuit partitioning , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[6]  Wilfried Daehn,et al.  Hardware Test Pattern Generation for Built-In Testing , 1981, International Test Conference.

[7]  Irith Pomeranz,et al.  3-weight Pseudo-random Test Generation Based on a Deterministic Test Set for Combinational and Sequential Circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Vishwani D. Agrawal,et al.  A Tutorial on Built-in Self-Test. I. Principles , 1993, IEEE Des. Test Comput..

[9]  John P. Robinson,et al.  A new built-in self-test method based on prestored testing , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.

[10]  Melvin A. Breuer,et al.  Test embedding with discrete logarithms , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Irith Pomeranz,et al.  COMPACTEST: a method to generate compact test sets for combinational circuits , 1993, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[12]  Hans-Joachim Wunderlich.  On Computing Optimized Input Probabilities for Random Tests , 1987, 24th ACM/IEEE Design Automation Conference.

[13]  G. Kemnitz,et al.  How To Do Weighted Random Testing For Bist? , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

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

[15]  Shambhu Upadhyaya,et al.  On-chip test generation for combinational circuits by LFSR modification , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

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

[17]  Melvin A. Breuer,et al.  Digital systems testing and testable design , 1990 .

[18]  Prawat Nagvajara,et al.  Pseudorandom testing for boundary-scan design with built-in self-test , 1991, IEEE Design & Test of Computers.

[19]  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.

[20]  Jacob Savir,et al.  A Multiple Seed Linear Feedback Shift Register , 1992, IEEE Trans. Computers.