Synthesis of Efficient Linear Test Pattern Generators

This paper presents a procedure for synthesis of linear test pattern generators called SLING. SLING can synthesize linear test pattern generators that satisfy constraints on area, speed, internal fan out, and randomness properties and outperform existing linear test pattern generator designs including linear feedback shift registers (LFSRs) and cellular automatons (CAs). SLING is a constraint-driven synthesis procedure that takes as input a set of constraints and then synthesizes a test pattern generator that satisfies those constraints. SLING uses a set of linear transformations that it applies iteratively to evolve a linear test pattern generator. Because of the way the transformations are chosen and constraints are set, a high degree of phase shift is maintained between every pair of linear sequences generated at different bit positions of the generator and cross and auto correlations are highly minimized. Hardware overhead in terms of XOR gates is also minimized. Comparative analysis and experimental results show the effectiveness of the proposed synthesis scheme

[1]  Janusz Rajski,et al.  High speed ring generators and compactors of test data [logic IC test] , 2003, Proceedings. 21st VLSI Test Symposium, 2003..

[2]  Sukumar Nandi,et al.  Additive cellular automata as an on-chip test pattern generator , 1993, Proceedings of 1993 IEEE 2nd Asian Test Symposium (ATS).

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

[4]  Nilanjan Mukherjee,et al.  Planar high performance ring generators , 2004, 22nd IEEE VLSI Test Symposium, 2004. Proceedings..

[5]  Jacob Savir,et al.  Built In Test for VLSI: Pseudorandom Techniques , 1987 .

[6]  Dimitrios Kagaris.  A unified method for phase shifter computation , 2005, TODE.

[7]  Janusz Rajski,et al.  Cellular automata-based test pattern generators with phase shifters , 2000, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Minesh B. Amin,et al.  Efficient compression and application of deterministic patterns in a logic BIST architecture , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[9]  Abraham Lempel,et al.  High Speed Generation of Maximal Length Sequences , 1971, IEEE Transactions on Computers.

[10]  Dimitris G. Maritsas,et al.  Toggle-Registers Generating in Parallel k kth Decimations of m-Sequences xP+ xk+ 1 Design Tables , 1979, IEEE Transactions on Computers.

[11]  H. Niederreiter,et al.  Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[12]  Edward J. McCluskey,et al.  Hybrid designs generating maximum-length sequences , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Janusz Rajski,et al.  Comparative study of CA-based PRPGs and LFSRs with phase shifters , 1999, Proceedings 17th IEEE VLSI Test Symposium (Cat. No.PR00146).

[14]  Dimitrios Kagaris.  Built-in TPG with designed phaseshifts , 2003, Proceedings. 21st VLSI Test Symposium, 2003..

[15]  Bernie Mulgrew,et al.  IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems , 1998 .

[16]  Janusz Rajski,et al.  Automated synthesis of large phase shifters for built-in self-test , 1998, Proceedings International Test Conference 1998 (IEEE Cat. No.98CH36270).

[17]  Dhiraj K. Pradhan,et al.  GLFSR-a new test pattern generator for built-in-self-test , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  John E. Hershey,et al.  High-Speed M-Sequence Generators , 1980, IEEE Transactions on Computers.