返回
Optimal selective Huffman coding for test-data compression
DOI:10.1109/TC.2007.1057.png)
摘要
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
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
Reliability and construct validity of the Automated Neuropsychological Assessment Metrics (ANAM) mood scale自动神经心理学评估指标 (ANAM) 情绪量表的信度和结构效度
The Impact of Maternal Influenza Vaccination on Influenza Disease Severity During Pregnancy and Postpartum in Rural Nepal母体流感疫苗接种对尼泊尔农村地区孕期及产后流感疾病严重程度的影响

