Implicit test sequences compaction for decreasing test application cost

Test pattern storage is an important problem affecting all Design for Testability (DfT) techniques based on scan-path. Test compaction is the key idea to reduce this problem, but in case of partial-scan test compaction would concern the concatenation and overlapping of test sequences instead of test vectors. Unfortunately, standard sequential TPGs do not show sufficient capabilities in test sequences compaction. Thus, the paper presents an innovative compaction strategy for test sequences based on implicit techniques. Preliminary results show that the use of the presented technique can sensibly reduce the amount of test patterns which mast be stored and applied.

[1]  Alberto L. Sangiovanni-Vincentelli,et al.  Irredundant sequential machines via optimal logic synthesis , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[2]  Janak H. Patel,et al.  Test compaction for sequential circuits , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[3]  Vishwani D. Agrawal,et al.  Test function embedding algorithms with application to interconnected finite state machines , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[5]  Enrico Macii,et al.  Symbolic optimization of FSM networks based on sequential ATPG techniques , 1996, DAC '96.

[6]  P. Goel.  Test Generation and Dynamic Compaction of Tests , 1979 .

[7]  Sheldon B. Akers,et al.  On the Complexity of Estimating the Size of a Test Set , 1984, IEEE Transactions on Computers.

[8]  Irith Pomeranz,et al.  COMPACTEST: A METHOD TO GENERATE COMPACT TEST SETS FOR COMBINATIONAL CIRCUITS , 1991, 1991, Proceedings. International Test Conference.

[9]  Fabio Somenzi,et al.  Fast sequential ATPG based on implicit state enumeration , 1991, 1991, Proceedings. International Test Conference.

[10]  Vishwani D. Agrawal,et al.  A partition and resynthesis approach to testable design of large circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  Prabhakar Goel,et al.  An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits , 1981, IEEE Transactions on Computers.

[12]  Vishwani D. Agrawal,et al.  A Complete Solution to The Partial Scan Problem , 1987 .

[13]  Jau-Shien Chang,et al.  Test set compaction for combinational circuits , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[14]  Franco Fummi,et al.  Testable synthesis of high complex control devices , 1995, Proceedings of EURO-DAC. European Design Automation Conference.

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

[16]  Robert K. Brayton,et al.  Implicit state enumeration of finite state machines using BDD's , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[17]  Bozena Kaminska,et al.  A new dynamic test vector compaction for automatic test pattern generation , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  P. Goel.  AN IMPLICIT ENUMERATION ALGORITHM TO GENERATE TESTS FOR COMBINATIONAL LOGIC CIRCUITS , 1995, Twenty-Fifth International Symposium on Fault-Tolerant Computing, 1995, ' Highlights from Twenty-Five Years'..

[19]  Franco Fummi,et al.  Sequential logic minimization based on functional testability , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[20]  Janak H. Patel,et al.  HITEC: a test generation package for sequential circuits , 1991, Proceedings of the European Conference on Design Automation..

[21]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .