Pseudoexhaustive BIST for sequential circuits

We present a method that can be used to test a sequential circuit pseudoexhaustively or almost pseudoexhaustively using LFSR/SRs as ATPGs with d-2/sup w/ test patterns, where d is the sequential depth and w is the input dependency limit. Our approach is based on the following techniques: (1) Use of LFSR/SRs as ATPGs (2) Rearrangement of the flip-flops of the circuit by retiming so that the hardware overhead for breaking all cycles and bounding the sequential depth is minimized. (3) Introduction of bypass storage cells (BSCs) so that no combinational element in the circuit has input dependence greater than a user-defined constant w. (4) Introduction of bypass delay cells (BDCs) so that the graph becomes more easily balanced or approximately balanced. Comparative experimental results indicate that our method behaves better than full-scan. It also outperforms a previous approach which, not only does not provide for on-chip TPG, but also requires O(q-f-2/sup 2/) test patterns, where q is the total number of primary or pseudoprimary outputs in the circuit and f is the total number of flip-flops.<<ETX>>

[1]  Wen-Ben Jone,et al.  A Coordinated Approach to Partitioning and Test Pattern Generation for Pseudoexhaustive Testing , 1989, 26th ACM/IEEE Design Automation Conference.

[2]  Hans-Joachim Wunderlich,et al.  The pseudoexhaustive test of sequential circuits , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Arnold L. Rosenberg,et al.  Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing , 1983, IEEE Transactions on Computers.

[4]  Hans-Joachim Wunderlich,et al.  Tools and devices supporting the pseudo-exhaustive test , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[5]  Spyros Tragoudas,et al.  Partial Scan with Retiming , 1993, 30th ACM/IEEE Design Automation Conference.

[6]  Spyros Tragoudas,et al.  Cost-effective LFSR synthesis for optimal pseudoexhaustive BIST test sets , 1993, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Kwang-Ting Cheng,et al.  Timing-driven partial scan , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  Arno Kunzmann,et al.  An analytical approach to the partial scan problem , 1990, J. Electron. Test..

[10]  Melvin A. Breuer,et al.  The BALLAST Methodology for Structured Partial Scan Design , 1990, IEEE Trans. Computers.

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

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Janak H. Patel,et al.  An optimization based approach to the partial scan design problem , 1990, Proceedings. International Test Conference 1990.

[14]  Fillia Makedon,et al.  On minimizing hardware overhead for pseudoexhaustive circuit testability , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[15]  Janak H. Patel,et al.  PROOFS: a super fast fault simulator for sequential circuits , 1990, Proceedings of the European Design Automation Conference, 1990., EDAC..

[16]  K.-T. Cheng,et al.  A Partial Scan Method for Sequential Circuits with Feedback , 1990, IEEE Trans. Computers.