The Community for Technology Leaders
Green Image
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.
Embedded Testing Techniques, IP Cores, Selective Huffman Coding, Test-Data Compression

E. Kalligeros, D. Nikolos and X. Kavousianos, "Optimal Selective Huffman Coding for Test-Data Compression," in IEEE Transactions on Computers, vol. 56, no. , pp. 1146-1152, 2007.
86 ms
(Ver 3.3 (11022016))