数学杂志2012，Vol.32Issue(4)：753-760,8.
一种基于多级查找表的高效Huffman编码算法
AN EFFICIENT HUFFMAN ENCODING ALGORITHM BASED ON MULTI-LEVEL AND LOOK-UP TABLE
摘要
Abstract
This article studies an efficient Huffman encoding algorithm which is fit for digital signal processor. By using multi-level and look-up table, a Huffman tree is partitioned into subtrees, then the partitioned subtrees are created a unique look-up table, we obtain the results that a Huffman tree can be stored by the smaller look-up table and the bitstreams can be decoded quickly by the look-up table.关键词
Huffman编码/数据压缩/数字信号处理器/查找表Key words
Huffman encode/ data compression/ digital signal processor/ look-up table分类
数理科学引用本文复制引用
胡丽莹,林鹭..一种基于多级查找表的高效Huffman编码算法[J].数学杂志,2012,32(4):753-760,8.基金项目
福建省教育厅A类基金资助(JA09055) （JA09055）
国家自然科学基金资助(10771022) （10771022）
福建省教育厅B类基金资助(JB08054). （JB08054）
