arrow
返回

Optimal selective Huffman coding for test-data compression

delete2007-08-01
delete97
PRE
AI
X
Xrysovalantis Kavousianos *
E
Emmanouil Kalligeros
D
Dimitris Nikolos
DOI:10.1109/TC.2007.1057delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

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.
Keyword:
embedded testing techniques
IP cores
selective Huffman coding
test-data compression

期刊

IEEE Transactions on Computers 封面图
IEEE Transactions on Computers
IF:
3.8
论文数:
5.4K
被引数:
9.8K

机构

暂无机构信息
引用论文

引用论文

err分享
err收藏
Localization of Salmon Cardiac Peptide (sCP) in the Heart of Salmon (Salmo salar L.)
err2000-12-01
err0
PREAI
errOlli Arjamaa; Raija Sormunen; Veli-Pekka Lehto; Olli Vuolteenaho
err分享
err收藏
err
IF0
err
err0
PREAI
err
err分享
err收藏
学者 查看更多内容