The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (2007 vol.56)
pp: 1146-1152
ABSTRACT
Selective Huffman coding has been recently proposed for efficient test-data compression with low hardware overhead. In this paper we show that the already proposed encoding scheme is not optimal and we present a new one, proving that it is optimal. Moreover, we compare the two encodings theoretically and we derive a set of conditions which show that, in practical cases, the proposed encoding offers always better compression. In terms of hardware overhead, the new scheme is at least as low-demanding as the old one. The increased compression efficiency, the resulting test-time savings, and the low hardware overhead of the proposed method are also verified experimentally.
INDEX TERMS
Embedded Testing Techniques, IP Cores, Selective Huffman Coding, Test-Data Compression
CITATION
Emmanouil Kalligeros, Xrysovalantis Kavousianos, "Optimal Selective Huffman Coding for Test-Data Compression", IEEE Transactions on Computers, vol.56, no. 8, pp. 1146-1152, August 2007, doi:10.1109/TC.2007.1057
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool