【摘要】 本文研究了适用于数字信号处理器的一种高效的Huffman编码算法的问题.利用多级查找表建立规则,并将Huffman树分割为若干子树且为分割后的所有子树建立一个统一的查找表的方法,获得了可用较小的查找表来存储Huffman树且能对比特流进行快速解码的结果.更多还原

【Abstract】 This article studies an efficient Huffman encoding algorithm which is fit fordigital signal processor. By using multi-level and look-up table, a Huffman tree is partitioned intosubtrees, then the partitioned subtrees are created a unique look-up table, we obtain the resultsthat a Huffman tree can be stored by the smaller look-up table and the bitstreams can be decodedquickly by the look-up table.更多还原