A Method for Compressing Test Data Based on Burrows-Wheeler Transformation

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]  Bernhard Balkenhol,et al.  Universal Data Compression Based on the Burrows-Wheeler Transformation: Theory and Practice , 2000, IEEE Trans. Computers.

[2]  Kunihiko Sadakane,et al.  A fast algorithm for making suffix arrays and for Burrows-Wheeler transformation , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[3]  Krishnendu Chakrabarty,et al.  Built-in self testing of sequential circuits using precomputed test sets , 1998, Proceedings. 16th IEEE VLSI Test Symposium (Cat. No.98TB100231).

[4]  Dong Sam Ha,et al.  COMPACT: a hybrid method for compressing test data , 1998, Proceedings. 16th IEEE VLSI Test Symposium (Cat. No.98TB100231).

[5]  Glen G. Langdon,et al.  Arithmetic Coding , 1979 .

[6]  M. Nelson.  Data compression with the Burrows-Wheeler Transform , 1996 .

[7]  Mark Nelson,et al.  The data compression book (2nd ed.) , 1995 .

[8]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[9]  James A. Storer,et al.  Data compression via textual substitution , 1982, JACM.

[10]  Abraham Lempel,et al.  Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.

[11]  Terry A. Welch,et al.  A Technique for High-Performance Data Compression , 1984, Computer.

[12]  N. Jesper Larsson,et al.  The context trees of block sorting compression , 1998, Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225).

[13]  Sandeep K. Gupta,et al.  A methodology to design efficient BIST test pattern generators , 1995, Proceedings of 1995 IEEE International Test Conference (ITC).

[14]  Jian Liu,et al.  Test width compression for built-in self testing , 1997, Proceedings International Test Conference 1997.

[15]  Dong Sam Ha,et al.  An efficient method for compressing test data , 1997, Proceedings International Test Conference 1997.

[16]  Gilbert Held,et al.  Data and image compression (4th ed.): tools and techniques , 1996 .

[17]  Mark Nelson,et al.  The Data Compression Book , 2009 .

[18]  D. J. Wheeler,et al.  A Block-sorting Lossless Data Compression Algorithm , 1994 .

[19]  Steve Apiki.  Lossless data compression , 1991 .

[20]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[21]  Roy Hoffman.  Data Compression in Digital Systems , 1997, Springer US.

[22]  Abraham Lempel,et al.  A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.