This Article 
 Bibliographic References 
 Add to: 
A Method for Compressing Test Data Based on Burrows-Wheeler Transformation
May 2002 (vol. 51 no. 5)
pp. 486-497

The overall throughput of automatic test equipment (ATE) is affected by the download time of test data. An effective approach to the reduction of the download time is to compress test data before the download. A compression algorithm for test data should meet two requirements: lossless and simple decompression. In this paper, we propose a new test data compression method that aims to fully utilize the unique characteristics of test data compression. The key idea of the proposed method is to perform the Burrows-Wheeler transformation on the sequence of test patterns and then to apply run-length coding. Experimental results show that our compression method performs better than six other methods for compressing test data. The average compression ratio of the proposed method performed on 15 test data sets is 94.6, while that for the next best one, Gzip, is 65.0. The experimental results also show that our method indeed reduces the download time significantly, provided a dedicated hardware decompressor is employed.

[1] D.A. Huffman, “A Method for the Construction of Minimum Redundancy Codes,” Proc. IRE, vol. 40, no. 9, pp. 1098-1101, Sept. 1952.
[2] J.J. Rissanen and G.G. Langdon, “Arithmetic Coding,” IBM J. Research and Development, vol. 23, no. 2, pp. 149-162, Mar. 1979.
[3] J. Ziv and A. Lempel, "A Universal Algorithm for Sequential Data Compression," IEEE Trans. Information Theory, vol. 23, no. 3, pp. 337-343, 1977.
[4] J. Ziv and A. Lempel, "Compression of Individual Sequence via Variable-Rate Coding," IEEE Trans. Information Theory, vol. 24, no. 5, pp. 530-536, 1978.
[5] T.A. Welch, “A Technique for High-Performance Data Compression,” Computer, vol. 17, no. 6, pp. 8-19, June 1984.
[6] S. Apiki, “Lossless Data compression,” Byte, vol. 16, no. 3, pp. 309-312, 314, 386-387, Mar. 1991.
[7] J.A. Storer and T.G. Szymanski, “Data Compression via Textual Substitution,” J. ACM, vol. 29, no. 4, pp. 928-951, Oct. 1982.
[8] M. Nelson and J.-L. Gailly, The Data Compression Book. M&T Books, 1996.
[9] G. Held, Data and Image Compression. John Wiley&Sons Ltd., 1996.
[10] R. Hoffman, Data Compression in Digital Systems. Chapman&Hall, 1997.
[11] C.H. Chen and S.K. Gupta, A Methodology to Design Efficient BIST Test Pattern Generators Proc. Int'l Test Conf., pp. 814-823, 1995.
[12] K. Chakrabarty, B.T. Murray, J. Liu, and M. Zhu, “Test Width Compression for Built-In Self-Testing,” Proc. Int'l Test Conf., pp. 328-337, Nov. 1997.
[13] V. Iyengar, K. Chakrabarty, and B.T. Murray, “Built-In Self Testing of Sequential Circuits Using Precomputed Test Sets,” Proc. VLSI Test Symp., pp. 418-422, Apr. 1998.
[14] T. Yamaguchi, M. Tilgner, M. Ishida, and D.S. Ha, “An Efficient Method for Compressing Test Data,” Proc. Int'l Test Conf., pp. 79-88, Nov. 1997.
[15] M. Ishida, D.S. Ha, and T. Yamaguchi, “COMPACT: A Hybrid Method for Compressing Test Data,” Proc. VLSI Test Symp., pp. 62-69, Apr. 1998.
[16] M. Burrows and D. Wheeler, “Block Sorting Lossless Data Compression Algorithm,” Research Report 124, System Research Center, Digital System Research Center, Palo Alto, CA, May 1994.
[17] M.R. Nelson, “Data Compression with the Burrows Wheeler Transformation,” Dr. Dobb's J., pp. 46-50, Sept. 1996.
[18] B. Balkenhol and S. Kurtz, “Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice,” IEEE Trans. Computers, vol. 49, no. 10, pp. 1043-1053, Oct. 2000.
[19] K. Sadakane, “A Fast Algorithm for Making Suffix Arrays and for Burrows-Wheeler Transformation,” Proc. IEEE Data Compression Conf., pp. 129-138, 1998.
[20] N. Larsson, “The Context Trees of Block Sorting Compression,” Proc. IEEE Data Compression Conf., pp. 189-198, 1998.

Index Terms:
Data compression, test data compression, compression, test data, Burrows-Wheeler transformation, run-length coding
T.J. Yamaguchi, D.S. Ha, M. Ishida, T. Ohmi, "A Method for Compressing Test Data Based on Burrows-Wheeler Transformation," IEEE Transactions on Computers, vol. 51, no. 5, pp. 486-497, May 2002, doi:10.1109/TC.2002.1004588
Usage of this product signifies your acceptance of the Terms of Use.