This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Fast Static Compaction Algorithms for Sequential Circuit Test Vectors
March 1999 (vol. 48 no. 3)
pp. 311-322

Abstract—Two fast algorithms for static test sequence compaction are proposed for sequential circuits. The algorithms are based on the observation that test sequences traverse through a small set of states and some states are frequently revisited throughout the application of a test set. Subsequences that start and end on the same states may be removed if necessary and if sufficient conditions are met for them. Contrary to the previously proposed methods, where multitudes of fault simulations are required, the techniques described in this paper require only two fault simulation passes and are applied to test sequences generated by various test generators, resulting in significant compactions very quickly for circuits that have many revisited states.

[1] T.M. Niermann, R.K. Roy, J.H. Patel,, and J.A. Abraham, “Test Compaction for Sequential Circuits,” IEEE Trans. Computer-Aided Design, vol. 11, no. 2, pp. 260-267, Feb. 1992.
[2] B. So, "Time Efficient Automatic Test Pattern Generation Systems," PhD thesis, Dept. of Electrical and Computer Eng., Univ. of Wisconsin-Madison, 1994.
[3] I. Pomeranz and S.M. Reddy, On Static Compaction of Test Sequences for Synchronous Sequential Circuits Proc. 33rd Design Automation Conf., pp. 215-220, June 1996.
[4] T. Niermann and J. Patel, HITEC: A Test Generation Package for Sequential Circuits Proc. European Conf. Design Automation, pp. 214-218, 1991.
[5] T.M. Niermann and J.H. Patel, “Method for Automatically Generating Test Vectors for Digital Integrated Circuits,” U.S. Patent No. 5,377,197, Dec. 1994.
[6] F. Brglez, D. Bryan, and K. Kozminski, "Combinatorial Profiles of Sequential Benchmark Circuits," Proc. IEEE Int'l. Symp. Circuits and Systems, IEEE Computer Soc. Press, Los Alamitos, Calif., 1989, pp. 1929-1934.
[7] T.H. Cormen,C.E. Leiserson, and R.L. Rivest,Introduction to Algorithms.Cambridge, Mass.: MIT Press/McGraw-Hill, 1990.
[8] E.M. Rudnick, J.H. Patel, G.S. Greenstein,, and T.M. Niermann, “A Genetic Algorithm Framework for Test Generation,” IEEE Trans. Computer-Aided Design, vol. 16, no. 9, pp. 1,034-1,044, Sept. 1997.
[9] E.M. Rudnick, “Simulation-Based Techniques for Sequential Circuit Testing,” PhD dissertation, Dept. of Electrical and Computer Eng., Technical Report CRHC-94-14/UILU-ENG-94-2229, Univ. of Illi nois, Aug. 1994.
[10] M.S. Hsiao, E.M. Rudnick,, and J.H. Patel, “Automatic Test Generation Using Genetically-Engineered Distinguishing Sequences,” Proc. VLSI Test Symp., pp. 216-223, 1996.
[11] M.S. Hsiao, E.M. Rudnick, and J.H. Patel, “Sequential Circuit Test Generation Using Dynamic State Traversal,” Proc. 1997 European Design and Test Conf., pp. 22-28, Mar. 1997.
[12] E.M. Rudnick and J.H. Patel, “Simulation-Based Techniques for Dynamic Test Sequence Compaction,” Proc. Int'l Conf. Computer-Aided Design, pp. 67-73, 1996.

Index Terms:
Static test set compaction, test generation, recurrence subsequence, fault simulation.
Citation:
Michael S. Hsiao, Elizabeth M. Rudnick, Janak H. Patel, "Fast Static Compaction Algorithms for Sequential Circuit Test Vectors," IEEE Transactions on Computers, vol. 48, no. 3, pp. 311-322, March 1999, doi:10.1109/12.754997
Usage of this product signifies your acceptance of the Terms of Use.