A novel method to improve the test efficiency of VLSI tests

Considers reducing the cost of test application by permuting test vectors to improve their defect coverage. Algorithms for test reordering are developed with the goal of minimizing the test cost. Best and worst case bounds are established for the performance of a reordered sequence compared to the original sequence of test application. SEMATECH test data and simulation results are used throughout to illustrate the ideas.

[1]  Vishwani D. Agrawal,et al.  Characterizing the LSI Yield Equation from Wafer Test Data , 1984, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Vishwani D. Agrawal,et al.  Reducing the complexity of defect level modeling using the clustering effect , 2000, DATE '00.

[3]  Sarita Thakar,et al.  On the generation of test patterns for combinational circuits , 1993 .

[4]  A. Gattiker,et al.  To DFT or not to DFT? , 1997, Proceedings International Test Conference 1997.

[5]  Duncan M. Walker.  Yield simulation for integrated circuits , 1987 .

[6]  Irith Pomeranz,et al.  ROTCO: a reverse order test compaction technique , 1992, Proceedings Euro ASIC '92.

[7]  Dong Sam Ha,et al.  HOPE: an efficient parallel fault simulator for synchronous sequential circuits , 1992, DAC '92.

[8]  C.H. Stapper,et al.  Integrated circuit yield statistics , 1983, Proceedings of the IEEE.

[9]  Wojciech Maly.  Optimal Order of the VLSI IC Testing Sequence , 1986, DAC 1986.

[10]  Kenneth M. Butler,et al.  So what is an optimal test mix? A discussion of the SEMATECH methods experiment , 1997, Proceedings International Test Conference 1997.

[11]  Thomas Williams,et al.  Test Length in a Self-Testing Environment , 1985, IEEE Design & Test of Computers.