摘要
Huffman压缩编码作为一种高效而简单的可变长编码而被广泛应用于信源编码。但现有的Huffman编码算法普遍存在着效率不高的问题,因此,提出一种自适应查找表Huffman编码算法。该算法对数据进行编码的依据是动态变化的表,对于首次出现的字符使用"KEY"的码字进行编码,将"KEY"下移,等待下一个首次出现的字符。与其他算法相比,改进算法Huffman编码的效率得以提高。
Considering that the existing Huffman coding algorithms are not efficient, an adaptive Huffman coding algorithm based on look-up table is proposed, which encodes the data according as the dynamic ta- bles are changing. By this algorithm, the first character is encoded to the code words of ＂KEY＂ firstly, and then, ＂KEY＂ is moved down until a new character turns up. Compared with others, the proposed algorithm can make Huffman coding run more efficiently.
出处
《西安邮电学院学报》
2011年第5期76-79,共4页
Journal of Xi'an Institute of Posts and Telecommunications
