The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2010 vol.59)
pp: 301-316
Stelios N. Neophytou , University of Nicosia, Cyprus
Maria K. Michael , University of Cyprus, Cyprus
ABSTRACT
This work presents two new methods for the generation of test sets with a small number of specified bits. Such type of test sets have been proven beneficial to a large number of test-related applications such as deterministic BIST, low power testing and test set enrichment. The first technique is static, since it considers an initial test set which attempts to relax via test replacement with tests of similar coverage but with fewer specified bits. The second technique is dynamic; it generates a test set from a zero base using a hierarchical fault-compatibility algorithm. Both methods are applicable to any enumerative fault method (linear to the circuit size). The experiments performed using the stuck-at fault model demonstrate the superiority of the proposed methods over comparable existing techniques, in reducing the total number of specified bits per generated test set. The applicability of the generated relaxed test sets is demonstrated for one, out of the many, possible applications, that of deterministic test set embedding. A general framework that integrates the proposed relaxation methods in two popular LFSR-based test set embedding schemes (full and partial reseeding), along with a systematic exploration of related parameters, is proposed. The obtained results show significant reductions in seed storage requirements.
INDEX TERMS
Reliability and testing, test generation, VLSI.
CITATION
Stelios N. Neophytou, Maria K. Michael, "Test Set Generation with a Large Number of Unspecified Bits Using Static and Dynamic Techniques", IEEE Transactions on Computers, vol.59, no. 3, pp. 301-316, March 2010, doi:10.1109/TC.2009.178
REFERENCES
[1] P. Girard, “Survey of Low-Power Testing of VLSI Circuits,” IEEE Design & Test, vol. 19, no. 3, pp. 82-92, May/June 2002.
[2] S. Wang and S. Gupta, “ATPG for Heat Dissipation Minimization During Test Application,” IEEE Trans. Computers, vol. 47, no. 2, pp. 256-262, Feb. 1998.
[3] S. Neophytou and M.K. Michael, and S. Tragoudas, “Test Set Enhancement for Quality Transition Faults Using Function-Based Methods,” Proc. Great Lakes Symp. Very Large Scale Integration (VLSI), pp. 182-187, 2005.
[4] S. Hellebrand, J. Rajski, S. Tarnick, S. Venkataraman, and B. Courtois, “Built In Test for Circuits with Scan Based on Reseeding of Multiple-Polynomial Linear Feedback Shift Registers,” IEEE Trans. Computers, vol. 44, no. 2, pp. 223-233, Feb. 1995.
[5] C. Krishna, A. Jas, and N. Touba, “Achieving High Encoding Efficiency with Partial Dynamic LFSR Reseeding,” ACM Trans. Design Automation of Electronic Systems, vol. 9, no. 4, pp. 500-516, 2004.
[6] S. Swaminathan and K. Chakrabarty, “On Using Twisted-Ring Counters for Test Set Embedding in BIST,” J. Electronic Testing, Theory and Applications, vol. 17, pp. 529-542, Dec. 2001.
[7] A. El-Maleh and Y. Osais, “Test Vector Decomposition-Based Static Compaction Algorithms for Combinational Circuits,” ACM Trans. Design Automation of Electronic Systems, vol. 8, no. 4, pp. 430-459, 2003.
[8] B. Ayari and B. Kaminska, “A New Dynamic Test Vector Compaction for Automatic Test Pattern Generation,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, no. 3, pp. 353-358, Mar. 1994.
[9] S. Kajihara, I. Pomeranz, K. Kinoshita, and S. Reddy, “Cost-Effective Generation of Minimal Test Sets for Stuck-at Faults in Combinational Logic Circuits,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 14, no. 12, pp. 1496-1504, Dec. 1995.
[10] I. Hamzaoglu and J.H. Patel, “Test Set Compaction Algorithms for Combinational Circuits,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 19, no. 8, pp. 957-963, Aug. 2000.
[11] Y. Matsunaga, “MINT—An Exact Algorithm for Finding Minimum Test Set,” IEICE Trans. Fundamentals of Electronics, Comm. and Computer Sciences, vol. 76, no. 10, pp. 1652-1658, 1993.
[12] S. Neophytou, M.K. Michael, and S. Tragoudas, “Efficient Deterministic Test Generation for BIST Schemes with LFSR Reseeding,” Proc. IEEE Int'l On-Line Testing Symp., pp. 43-50, 2006.
[13] K. Miyase and S. Kajihara, “XID: Don't Care Identification of Test Patterns for Combinational Circuits,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 23, no. 2, pp. 321-326, Feb. 2004.
[14] A. El-Maleh and A.A. Suwaiyan, “An Efficient Test Relaxation Technique for Combinational & Full-Scan Sequential Circuits,” Proc. Very Large Scale Integration (VLSI) Test Symp., pp. 53-59, 2002.
[15] R. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Trans. Computers, vol. 35, no. 8, pp. 677-691, Aug. 1986.
[16] B. Koenemann, “LFSR-Coded Test Patterns for Scan Designs,” Proc. European Test Conf., pp. 237-242, 1991.
[17] P. Flores, H. Neto, and J. Marques-Silva, “An Exact Solution to the Minimum Size Test Pattern Problem,” ACM Trans. Design Automation of Electronic Systems, vol. 6, no. 4, pp. 629-644, 2001.
[18] H. Lee and D. Ha, “Atalanta: An Efficient ATPG for Combinational Circuits,” technical report, Dept. of Electrical Eng., Virginia Polytechnic Inst. and State Univ., 1993.
[19] M. Bushnell and V. Agrawal, Essentials of Electronic Testing. Kluwer Academic Publishers, 2000.
[20] M. Michael and S. Tragoudas, “ATPG Tools for Delay Faults at the Functional Level,” ACM Trans. Design Automation of Electronic Systems, vol. 7, no. 1, pp. 33-57, 2002.
[21] A. Narayan, J. Jain, M. Fujita, and A. Sangiovanni-Vincentelli, “Partitioned ROBDDs—A Compact, Canonical and Efficiently Manipulable Representation for Boolean Functions,” Proc. Int'l Conf. Computer-Aided Design, pp. 547-554, 1996.
[22] V. Paruthi and A. Kuehlmann, “Equivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation,” Proc. Int'l Conf. Computer Design, pp. 459-464, 2000.
[23] A. Gupta, M. Ganai, C. Wang, Z. Yang, and P. Ashar, “Learning from BDDs in SAT-Based Bounded Model Checking,” Proc. Design Automation Conf., pp. 824-829, 2003.
[24] R. Drechsler, G. Fey, and S. Kinder, “An Integrated Approach for Combining BDD and SAT Provers,” Proc. Int'l Conf. Very Large Scale Integration (VLSI) Design, pp. 237-242, 2006.
[25] K.D. Wagner, C.K. Chin, and E.J. McCluskey, “Pseudorandom Testing,” IEEE Trans. Computers, vol. 36, no. 3, pp. 332-343, Mar. 1987.
[26] S. Hellebrand, B. Reeb, H.-J. Wunderlich, and S. Tarnick, “Pattern Generation for a Deterministic BIST Scheme,” Proc. Int'l Conf. Computer-Aided Design, 1995.
[27] E. Kalligeros, D. Kaseridis, X. Kavousianos, and D. Nikolos, “Reseeding-Based Test Set Embedding with Reduced Test Sequences,” Proc. Int'l Symp. Quality of Electronic Design, pp. 226-231, 2005.
[28] L. Li and K. Chakrabarty, “Hybrid BIST Based on Repeating Sequences and Cluster Analysis,” Proc. Design Automation and Test in Europe, vol. 2, pp. 1142-1147, 2005.
[29] H. Liang, S. Hellebrand, and H.-J. Wunderlich, “Two-Dimensional Test Data Compression for Scan-Based Deterministic BIST,” Proc. Int'l Test Conf., pp. 894-902, 2001.
[30] J. Rajski, J. Tyszer, and N. Zacharia, “Test Data Decompression for Multiple Scan Designs with Boundary Scan,” IEEE Trans. Computers, vol. 47, no. 11, pp. 1188-1200, Nov. 1998.
[31] S. Hellebrand, S. Tarnick, B. Courtois, and J. Rajski, “Generation of Vector Patterns through Reseeding of Multiple-Polynomial Linear Feedback Shift Registers,” Proc. Int'l Test Conf., pp. 120-129, 1992.
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool