A novel pattern generator for near-perfect fault-coverage

A new design methodology for a pattern generator is proposed, formulated in the context of on-chip BIST. The pattern generator consists of two components: a GLFSR, earlier proposed as a pseudo-random pattern generator, and combinational logic, to snap the outputs of the pseudo-random pattern generator. Using fewer test patterns with only a small area overhead, this combinatorial logic block, for a particular CUT, can be designed to achieve nearly 100% single stuck-at fault coverage. Specifically, where weighted pattern generators only enhance the probability of testing a specified set of hard-to-detect faults, the proposed combinational logic, using a comparable hardware overhead, can guarantee generating the test for those faults. Experimental results demonstrate that under identical conditions, the fault coverage of the proposed pattern generator is significantly higher, compared to the conventional weighted pattern generation techniques. For enhancing effectiveness, this combinational logic mapping technique can also be used to augment any weighted pattern technique. Because LFSRs are special cases of GLFSRs, our design is more general than LFSR-based designs.

[1]  Dhiraj K. Pradhan,et al.  A New Framework for Designing and Analyzing BIST Techniques and Zero Aliasing Compression , 1991, IEEE Trans. Computers.

[2]  Michael Bershteyn Calculation of multiple sets of weights for weighted random testing , 1993, Proceedings of IEEE International Test Conference - (ITC).

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

[4]  Dhiraj K. Pradhan,et al.  GLFSR-a new test pattern generator for built-in-self-test , 1994, Proceedings., International Test Conference.

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

[6]  John A. Waicukauski,et al.  Fault detection effectiveness of weighted random patterns , 1988, International Test Conference 1988 Proceeding@m_New Frontiers in Testing.

[7]  Janusz Rajski,et al.  Cube-Contained Random Patterns and Their Applications to the Complete Testing of Synthesized Multi-Level Circuits , 1991 .

[8]  Yashwant K. Malaiya,et al.  The Coverage Problem for Random Testing , 1984, ITC.

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

[10]  Howard C. Card,et al.  Parallel Random Number Generation for VLSI Systems Using Cellular Automata , 1989, IEEE Trans. Computers.

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

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

[13]  Don E. Ross,et al.  LFSR based deterministic hardware for at-speed BIST , 1993, Digest of Papers Eleventh Annual 1993 IEEE VLSI Test Symposium.

[14]  Hans-Joachim Wunderlich,et al.  Generating pattern sequences for the pseudo-exhaustive test of MOS-circuits , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[15]  Giovanni De Micheli,et al.  Synthesis and Optimization of Digital Circuits , 1994 .