.png){kind=icon}
Return
Optimal selective Huffman coding for test-data compression
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.1057.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Selective Huffman coding has recently been 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 always offers 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.
Keywords:
embedded testing techniques
IP cores
selective Huffman coding
test-data compression
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more