• Publication
  • 2004
  • Issue No. 12 - December
  • Abstract - Static Test Compaction for Full-Scan Circuits Based on Combinational Test Sets and Nonscan Input Sequences and a Lower Bound on the Number of Tests
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Static Test Compaction for Full-Scan Circuits Based on Combinational Test Sets and Nonscan Input Sequences and a Lower Bound on the Number of Tests
December 2004 (vol. 53 no. 12)
pp. 1569-1581
A new class of static compaction procedures is described that generate test sets with reduced test application times for scan circuits. The proposed class of procedures combines the advantages of two earlier static compaction procedures, one that tends to generate large numbers of tests with a short primary input sequence included in every test and one that tends to generate small numbers of tests with a long primary input sequence included in one of the tests. A procedure of the proposed class starts from an initial test set that has a large number of tests and long primary input sequences and it selects a subset of the tests and subsequences of their primary input sequences. It thus has the flexibility of finding an appropriate balance between the number of tests and the lengths of the primary input sequences in order to minimize the test application time. Several ways of computing the primary input sequences for the initial test set are considered. The most compact test sets are obtained when a test sequence for the nonscan circuit is available and this sequence is used as part of every test in the initial test set. However, it is shown that high levels of compaction can also be achieved without the overhead of test generation for the nonscan circuit. Specifically, we show that the industry practice of holding a primary input vector constant between scan operations can be accommodated. We estimate the ability of the procedure to achieve optimum test sets by computing a lower bound on the number of tests and demonstrating that the procedure achieves or approaches this lower bound.

[1] P. Goel, “An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits,” IEEE Trans. Computers, vol. 30, no. 3, pp. 215-222, Mar. 1981.
[2] H. Fujiwara and T. Shimono, “On the Acceleration of Test Generation Algorithms,” IEEE Trans. Computers, vol. 32, no. 12, pp. 1137-1144, Dec. 1983.
[3] M. Schulz et al., “SOCRATES: A Highly Efficient Automatic Test Pattern Generation System,” IEEE Trans. Computer-Aided Design, pp. 126-137, Jan. 1988.
[4] S. Kajihara, I. Pomeranz, K. Kinoshita, and S.M. Reddy, “Cost-Effective Generation of Minimal Test Sets for Stuck-At Faults in Combinational Logic Circuits,” IEEE Trans. Computer-Aided Design, pp. 1496-1504, Dec. 1995.
[5] I. Hamazaoglu and J.H. Patel, “Test Set Compaction Algorithms for Combinational Circuits,” Proc. Int'l Conf. Computer-Aided Design, pp. 283-289, 1998.
[6] D.K. Pradhan and J. Saxena, “A Design for Testability Scheme to Reduce Test Application Time in Full Scan,” Proc. 10th VLSI Test Symp., pp. 55-60, Apr. 1992.
[7] S.Y. Lee and K.K. Saluja, “An Algorithm to Reduce Test Application Time in Full Scan Designs,” Proc. 1992 Int'l Conf. Computer-Aided Design, pp. 17-20, Nov. 1992.
[8] S.Y. Lee and K.K. Saluja, “Test Application Time Reduction for Sequential Circuits with Scan,” IEEE Trans. Computer-Aided Design, pp. 1128-1140, Sept. 1995.
[9] I. Pomeranz and S.M. Reddy, “Static Test Compaction for Scan-Based Designs to Reduce Test Application Time,” Proc. Seventh Asian Test Symp., pp. 198-203, Dec. 1998.
[10] I. Pomeranz and S.M. Reddy, “Reducing Test Application Time for Full Scan Circuits by the Addition of Transfer Sequences,” Proc. Ninth Asian Test Symp., pp. 317-322, Nov. 2000.
[11] I. Pomeranz and S.M. Reddy, “An Approach to Test Compaction for Scan Circuits that Enhances At-Speed Testing,” Proc. 38th Design Automation Conf., pp. 156-161, June 2001.
[12] P.C. Maxwell, R.C. Aitken, K.R. Kollitz, and A.C. Brown, “IDDQ and AC Scan: The War Against Unmodelled Defects,” Proc. 1996 Int'l Test Conf., pp. 250-258, Oct. 1996.
[13] L. Nachman, K.K. Saluja, S. Upadhyaya, and R. Reuse, “Random Pattern Testing for Sequential Circuits Revisited,” Proc. 26th Fault-Tolerant Computing Symp., pp. 44-52, June 1996.
[14] 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.
[15] I. Pomeranz and S.M. Reddy, “Vector Restoration Based Static Compaction of Test Sequences for Synchronous Sequential Circuits,” Proc. Int'l Conf. Computer Design, pp. 360-365, Oct. 1997.
[16] R. Guo, S.M. Reddy, and I. Pomeranz, “PROPTEST: A Property Based Test Pattern Generator for Sequential Circuits Using Test Compaction,” Proc. 36th Design Automation Conf., pp. 653-659, June 1999.
[17] I. Pomeranz and S.M. Reddy, “On Removing Redundancies from Synchronous Sequential Circuits with Synchronizing Sequences,” IEEE Trans. Computers, pp. 20-32, Jan. 1996.

Index Terms:
Scan circuits, static test compaction, test application time.
Citation:
Irith Pomeranz, Sudhakar M. Reddy, "Static Test Compaction for Full-Scan Circuits Based on Combinational Test Sets and Nonscan Input Sequences and a Lower Bound on the Number of Tests," IEEE Transactions on Computers, vol. 53, no. 12, pp. 1569-1581, Dec. 2004, doi:10.1109/TC.2004.118
Usage of this product signifies your acceptance of the Terms of Use.