A Comprehensive Test Compression Scheme Based on Precomputed Test Sets

Article Preview

Abstract:

To cope with increasingly rigorous challenges that large scale digital integrated circuit testing is confronted with, a comprehensive compression scheme consisting of test-bit rearrangement algorithm, run-length assignment strategy and symmetrical code is proposed. The presented test-bit rearrangement algorithm can fasten dont-care bits, 0s or 1s in every test pattern on one of its end to the greatest extent so as to lengthen end-run blocks and decrease number of short run-lengths. A dynamical dont-care assignment strategy based on run-lengths can be used to specify the remaining dont-care bits after the test-bit rearrangement, which can decrease run-length splitting and maximize length of run-lengths. The symmetrical code benefits from long run-lengths and only uses 2 4-bit short code words to identify end-run blocks almost as long as a test pattern, and hence the utilization ratio of code words can be heightened. The presented experiment results show that the proposed comprehensive scheme can obtain very higher data compression ratios than other compression ones published up to now, especially for large scale digital integrated circuits, and considerably decrease test power dissipations.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 756-759)

Pages:

533-541

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] A. Chandra, and K. Chakrabarty, Test data compression and test resource partitioning for system-on-a-chip using frequency- directed run-length (FDR) codes, IEEE Transactions on Computers, vol. 52, no. 8, pp.1076-1088, Aug. (2003).

DOI: 10.1109/tc.2003.1223641

Google Scholar

[2] A. Chandra, and K. Chakrabarty, Low-power scan testing and test data compression for system-on a-chip, IEEE Transactions on Computer-Aided Design of Integrated Circuits & Systems, vol. 21, no. 5, pp.597-604, May (2002).

DOI: 10.1109/43.998630

Google Scholar

[3] Y.H. Han, Y.J. Xu, and X.W. Li, Co-optimization for test data compression and testing power based on variable-tail code, Proc. the 5th International Conference on ASIC, p.105 – 108, Oct. (2003).

DOI: 10.1109/icasic.2003.1277501

Google Scholar

[4] J.H. Feng, and G.L. Li. A test data compression method for system-on-a-chip, Proc. the 4th IEEE International Symposium on Electronic Design, Test and Applications, p.270 – 273, Jan. (2008).

DOI: 10.1109/delta.2008.30

Google Scholar

[5] A. H. El-Maleh, Test data compression for system-on-a-chip using extended frequency-directed run-length code, IET Computers & Digital Techniques, vol. 2, no. 3, p.155 – 163, May (2008).

DOI: 10.1049/iet-cdt:20070028

Google Scholar

[6] A. Chandra, and K. Chakrabarty, A unified approach to reduce SOC test data volume, scan power and testing time, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on. Vol. 22, no. 3, p.352 – 363, march (2003).

DOI: 10.1109/tcad.2002.807895

Google Scholar

[7] P. T. Gonciari, and B. M. Al-Hashimi. Variable-length input Huffman coding for system-on-a-chip test, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems,vol. 22, no. 6, 783- 796, June (2003).

DOI: 10.1109/tcad.2003.811451

Google Scholar

[8] A. Jas, J. Ghosh-Dastidar, N. Mom-Eng,and N. A. Touba, An efficient test vector compression scheme using selective Huffman coding, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 6, pp.797-806, June (2003).

DOI: 10.1109/tcad.2003.811452

Google Scholar

[9] X. Kavousianos, E. Kalligeros, and D. Nikolos, Optimal Selective Huffman Coding for Test-Data Compression, IEEE Transactions on Computers,vol. 56, no. 8, p.1146 – 1152, June (2007).

DOI: 10.1109/tc.2007.1057

Google Scholar