A genetic approach to test application time reduction for full scan and partial scan circuits

Full scan and partial scan are effective design-for-testability techniques for achieving high fault coverage. However, test application time can be high if long scan chains are used. Reductions in test application time can be made if flip-flop values are not scanned in and out before and after every test vector is applied. Previous research has used deterministic fault-oriented combinational and sequential circuit test generators in generating test vectors and sequences and in deciding when to scan the flip-flops. In this work we use genetic algorithms to generate compact test sets which limit the scan operations. Results for the ISCAS89 sequential benchmark circuits show that significant reductions in test application time can be achieved, especially for partial scan circuits.

[1]  Melvin A. Breuer,et al.  Ordering storage elements in a single scan chain , 1991, 1991 IEEE International Conference on Computer-Aided Design Digest of Technical Papers.

[2]  R. Dandapani,et al.  Scan Design Using Standard Flip-Flops , 1987, IEEE Design & Test of Computers.

[3]  Melvin A. Breuer,et al.  Configuring multiple scan chains for minimum test time , 1992, ICCAD.

[4]  Kewal K. Saluja,et al.  Sequential test generation with reduced test clocks for partial scan designs , 1994, Proceedings of IEEE VLSI Test Symposium.

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

[6]  Niraj K. Jha,et al.  Synthesis of sequential circuits for parallel scan , 1992, [1992] Proceedings The European Conference on Design Automation.

[7]  D. G. Saab,et al.  Partial Reset: An Alternative DFT Approach , 1994 .

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

[9]  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.

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  Kewal K. Saluja,et al.  An algorithm to reduce test application time in full scan designs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[12]  Janak H. Patel,et al.  PROOFS: a fast, memory-efficient sequential circuit fault simulator , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Chen-Shang Lin,et al.  Test time reduction in scan designed circuits , 1993, 1993 European Conference on Design Automation with the European Event in ASIC Design.

[14]  Elizabeth M. Rudnick,et al.  Sequential Circuit Test Generation in a Genetic Algorithm Framework , 1994, 31st Design Automation Conference.

[15]  David Bryan,et al.  Combinational profiles of sequential benchmark circuits , 1989, IEEE International Symposium on Circuits and Systems,.

[16]  Ralph Marlett,et al.  Selectable Length Partial Scan: A Method to Reduce Vector Length , 1991, 1991, Proceedings. International Test Conference.

[17]  R. Gupta,et al.  Configuring multiple scan chains for minimum test time , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

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

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