A New Static Compaction of Deterministic Test Sets
Pages 411 - 420
Abstract
Test set compaction is one of the key steps of the postproduction test known to bring down test pattern counts. This, in turn, allows one to reduce the corresponding test data volume, test application time, and hence the cost of testing. This article presents a method that strives to reduce the number of automatic test pattern generation (ATPG)-produced deterministic test patterns to deliver compact test sets. In principle, the new scheme works with a meaningful representation of test patterns by using external and internal necessary assignments (NAs) to determine small groups of potentially compatible faults. These faults are subsequently retargeted by the robust satisfiability (SAT)-based ATPG that produces a single test pattern for the entire group, thus making the resultant test set smaller in size. Experimental results obtained for 12 large industrial cores and stuck-at faults confirm superiority of the proposed scheme over the state-of-the-art test set compaction techniques and are reported herein.
References
[1]
M. Abramovici, M. A. Breuer, and A. D. Friedman, Digital Systems Testing and Testable Design. Piscataway, NJ, USA: IEEE Press, 1995.
[2]
C. Aceroet al., “Embedded deterministic test points,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 25, no. 10, pp. 2949–2961, Oct. 2017.
[3]
S. T. Chakradhar and V. D. Agrawal, “A transitive closure based algorithm for test generation,” in Proc. 28th Conf. ACM/IEEE Design Autom. Conf. (DAC), Jun. 1991, pp. 353–358.
[4]
J.-S. Chang and C.-S. Lin, “Test set compaction for combinational circuits,” IEEE Trans. Comput.-Aided Design Integr., vol. 14, no. 11, pp. 1370–1378, Nov. 1995.
[5]
A. Czutro, I. Polian, P. Engelke, S. M. Reddy, and B. Becker, “Dynamic compaction in SAT-based ATPG,” in Proc. Asian Test Symp., 2009, pp. 187–190.
[6]
R. Drechsleret al., “On acceleration of SAT-based ATPG for industrial designs,” IEEE Trans. Comput.-Aided Design Integr., vol. 27, no. 7, pp. 1329–1333, Jul. 2008.
[7]
N. Eén and N. Sörensson, “An extensible SAT-solver,” in Proc. Int. Conf. Theory Appl. Satisfiability Test., in Lecture Notes in Computer Science, Berlin, Springer, vol. 2919, 2003, pp. 502–518.
[8]
N. Eén and N. Sörensson, “Translating pseudo-Boolean constraints into SAT,” J. Satisf. Boolean Model. Comput., vol. 2, nos. 1–4, pp. 1–26, 2006.
[9]
S. Eggersgluss and R. Drechsler, “Improving test pattern compactness in SAT-based ATPG,” in Proc. 16th Asian Test Symp. (ATS), Oct. 2007, pp. 445–452.
[10]
S. Eggersglu, R. Krenz-Baath, A. Glowatz, F. Hapke, and R. Drechsler, “A new SAT-based ATPG for generating highly compacted test sets,” in Proc. IEEE 15th Int. Symp. Design Diag. Electron. Circuits Syst. (DDECS), Apr. 2012, pp. 230–235.
[11]
S. Eggersglus, S. Milewski, J. Rajski, and J. Tyszer, “On reduction of deterministic test pattern sets,” in Proc. IEEE Int. Test Conf. (ITC), Oct. 2021, pp. 260–267.
[12]
S. Eggersgluss, K. Schmitz, R. Krenz-Baath, and R. Drechsler, “On optimization-based ATPG and its application for highly compacted test sets,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 35, no. 12, pp. 2104–2117, Apr. 2016.
[13]
Fujiwara and Shimono, “On the acceleration of test generation algorithms,” IEEE Trans. Comput., vols. C–32, no. 12, pp. 1137–1144, Dec. 1983.
[14]
J. Giraldi and M. L. Bushnell, “EST: The new frontier in automatic test-pattern generation,” in Proc. 27th ACM/IEEE Design Automat. Conf., Jun. 1990, pp. 667–672.
[15]
P. Goel, “An implicit enumeration algorithm to generate tests for combinational logic circuits,” IEEE Trans. Comput., vols. C–30, no. 3, pp. 215–222, Mar. 1981.
[16]
I. Hamzaoglu and J. H. Patel, “Test set compaction algorithms for combinational circuits,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 19, no. 8, pp. 957–963, Aug. 2000.
[17]
M. S. Hsiao, E. M. Rudnick, and J. H. Patel, “Fast static compaction algorithms for sequential circuit test vectors,” IEEE Trans. Comput., vol. 48, no. 3, pp. 311–322, Mar. 1999.
[18]
Y. Huang, S. Milewski, J. Rajski, J. Tyszer, and C. Wang, “Low cost hypercompression of test data,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 39, no. 10, pp. 2964–2975, Oct. 2020.
[19]
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. Comput.-Aided Design Integr. Circuits Syst., vol. 14, no. 12, pp. 1496–1504, Dec. 1995.
[20]
R. Kapur, S. Mitra, and T. W. Williams, “Historical perspective on scan compression,” IEEE Design Test Comput., vol. 25, no. 2, pp. 114–120, Mar. 2008.
[21]
T. Kirkland and M. R. Mercer, “A topological search algorithm for ATPG,” in Proc. 24th ACM/IEEE Conf. Proc. Design Autom. Conf. (DAC), Jun. 1987, pp. 502–508.
[22]
W. Kunz and D. K. Pradhan, “Recursive learning: A new implication technique for efficient solutions to CAD problems-test, verification, and optimization,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 13, no. 9, pp. 1143–1158, 1994.
[23]
T. Larrabee, “Test pattern generation using Boolean satisfiability,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 11, no. 1, pp. 4–15, Jan. 1992.
[24]
X. Lin, J. Rajski, I. Pomeranz, and S. M. Reddy, “On static test compaction and test pattern ordering for scan designs,” in Proc. Int. Test Conf., 2001, pp. 1088–1097.
[25]
K. Miyase and S. Kajihara, “XID: Don’t care identification of test patterns for combinational circuits,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 23, no. 2, pp. 321–326, Feb. 2004.
[26]
S. N. Neophytou and M. K. Michael, “Test set generation with a large number of unspecified bits using static and dynamic techniques,” IEEE Trans. Comput., vol. 59, no. 3, pp. 301–316, Mar. 2010.
[27]
S. N. Neophytou and M. K. Michael, “Test pattern generation of relaxed n-detect test sets,” IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 20, no. 3, pp. 410–423, Mar. 2012.
[28]
I. Pomeranz and S. M. Reddy, “Forward-looking fault simulation for improved static compaction,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 20, no. 10, pp. 1262–1265, Oct. 2001.
[29]
I. Pomeranz and S. M. Reddy, “Forward-looking reverse order fault simulation for n-detection test sets,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 28, no. 9, pp. 1424–1428, Sep. 2009.
[30]
I. Pomeranz, L. N. Reddy, and S. M. Reddy, “COMPACTEST: A method to generate compact test sets for combinational circuits,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 12, no. 7, pp. 1040–1049, Jul. 1993.
[31]
J. Rajski and H. Cox, “A method to calculate necessary assignments in algorithmic test pattern generation,” in Proc. Int. Test Conf., 1990, pp. 25–34.
[32]
J. Rajski, J. Tyszer, M. Kassab, and N. Mukherjee, “Embedded deterministic test,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 23, no. 5, pp. 776–792, May 2004.
[33]
J. P. Roth, “Diagnosis of automata failures: A calculus and a method,” IBM J. Res. Develop., vol. 10, no. 4, pp. 278–291, Jul. 1966.
[34]
J. P. Roth, W. G. Bouricius, and P. R. Schneider, “Programmed algorithms to compute tests to detect and distinguish between failures in logic circuits,” IEEE Trans. Electron. Comput., vols. EC–16, no. 5, pp. 567–580, Oct. 1967.
[35]
M. Sauer, S. Reimer, T. Schubert, I. Polian, and B. Becker, “Efficient SAT-based dynamic compaction and relaxation for longest sensitizable paths,” in Proc. Design, Autom. Test Eur. Conf. Exhib. (DATE), 2013, pp. 448–453.
[36]
M. H. Schulz and E. Auth, “Improved deterministic test pattern generation with applications to redundancy identification,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 8, no. 7, pp. 811–816, Jul. 1989.
[37]
M. H. Schulz, E. Trischler, and T. M. Sarfert, “SOCRATES: A highly efficient automatic test pattern generation system,” IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. CAD-7, no. 1, pp. 126–137, Jan. 1988.
[38]
N. A. Touba, “Survey of test vector compression techniques,” IEEE Des. Test Comput., vol. 23, no. 4, pp. 294–303, Apr. 2006.
[39]
J. A. Waicukauski, P. A. Shupe, D. J. Giramma, and A. Matin, “ATPG for ultra-large structured designs,” in Proc. Int. Test Conf., 1990, pp. 44–51.
Recommendations
Static compaction for two-pattern test sets
ATS '95: Proceedings of the 4th Asian Test SymposiumWe propose a static compaction procedure to reduce the size of a test set comprised of two-pattern tests. The procedure reorders the tests in the test set to maximize the number of faults detected by adjacent patterns, thus allowing some of the tests to ...
Compaction of Compressed Bounded Transparent-Scan Test Sets
GLSVLSI '22: Proceedings of the Great Lakes Symposium on VLSI 2022Bounded transparent-scan supports test compaction beyond that achievable with conventional scan-based tests. This article considers the compression of bounded transparent-scan tests. All the components of a test (scan-in state, primary input vector, ...
Static Test Compaction for Multiple Full-Scan Circuits
ICCD '03: Proceedings of the 21st International Conference on Computer DesignCurrent design methodologies and methodologies for reducing test data volume and test application time for full-scan circuits allow testing of multiple circuits (or subcircuits of the same circuit) simultaneously using the same test data. We describe ...
Comments
Information & Contributors
Information
Published In
1063-8210 © 2023 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 April 2023
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Nov 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in