On undetectable faults in partial scan circuits

We provide a definition of undetectable faults in partial scan circuits under a test application scheme where a test consists of primary input vectors applied at-speed between scan operations. We also provide sufficient conditions for a fault to be undetectable under this test application scheme. We present experimental results on finite-state machine benchmarks to demonstrate the effectiveness of these conditions in identifying undetectable faults.

[1]  Irith Pomeranz,et al.  Classification of Faults in Synchronous Sequential Circuits , 1993, IEEE Trans. Computers.

[2]  Kewal K. Saluja,et al.  Test application time reduction for sequential circuits with scan , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Kewal K. Saluja,et al.  An algorithm to reduce test application time in full scan designs , 1992, ICCAD.

[4]  Dhiraj K. Pradhan,et al.  A design for testability scheme to reduce test application time in full scan , 1992, Digest of Papers. 1992 IEEE VLSI Test Symposium.

[5]  Qiang Peng,et al.  MUST: multiple-stem analysis for identifying sequentially untestable faults , 2000, Proceedings International Test Conference 2000 (IEEE Cat. No.00CH37159).

[6]  On identifying undetectable and redundant faults in synchronous sequential circuits , 1994, Proceedings of IEEE VLSI Test Symposium.

[7]  Kwang-Ting Cheng.  On removing redundancy in sequential circuits , 1991, 28th ACM/IEEE Design Automation Conference.

[8]  Janak H. Patel,et al.  A graph traversal based framework for sequential logic implication with an application to C-cycle redundancy identification , 2001, VLSI Design 2001. Fourteenth International Conference on VLSI Design.

[9]  Irith Pomeranz,et al.  Full scan fault coverage with partial scan , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[10]  David E. Long,et al.  Identifying sequential redundancies without search , 1996, DAC '96.

[11]  Miron Abramovici,et al.  Sequentially untestable faults identified without search ("simple implications beat exhaustive search!") , 1994, Proceedings., International Test Conference.

[12]  Irith Pomeranz,et al.  On finding undetectable and redundant faults in synchronous sequential circuits , 1998, Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273).

[13]  Irith Pomeranz,et al.  Simulation based test generation for scan designs , 2000, IEEE/ACM International Conference on Computer Aided Design. ICCAD - 2000. IEEE/ACM Digest of Technical Papers (Cat. No.00CH37140).

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

[15]  Vishwani D. Agrawal,et al.  Combinational ATPG theorems for identifying untestable faults in sequential circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..