| 基于查找表的自适应Huffman编码算法 |
| |
| 引用本文： | 雒莎,葛海波. 基于查找表的自适应Huffman编码算法[J]. 西安邮电学院学报, 2011, 16(5): 76-79 |
| |
| 作者姓名： | 雒莎 葛海波 |
| |
| 作者单位： | 1. 西安邮电学院通信与信息工程学院,陕西西安,710121
2. 西安邮电学院电子工程学院,陕西西安,710121 |
| |
| 摘 要： | Huffman压缩编码作为一种高效而简单的可变长编码而被广泛应用于信源编码。但现有的Huffman编码算法普遍存在着效率不高的问题,因此,提出一种自适应查找表Huffman编码算法。该算法对数据进行编码的依据是动态变化的表,对于首次出现的字符使用"KEY"的码字进行编码,将"KEY"下移,等待下一个首次出现的字符。与其他算法相比,改进算法Huffman编码的效率得以提高。
|
| 关 键 词： | 查找表 Huffman编码 Huffman树 |
On adaptive Huffman coding based on Look-up table |
| |
| LUO Sha,GE Hai-bo. On adaptive Huffman coding based on Look-up table[J]. Journal of Xi'an Institute of Posts and Telecommunications, 2011, 16(5): 76-79 |
| |
| Authors: | LUO Sha GE Hai-bo |
| |
| Affiliation: | LUO Sha1,GE Hai-bo2(1.School of Communication and Information Engineering,Xi'an University of Posts and Telecommunications,Xi'an 710121,China,2.School of Electronic Engineering,China) |
| |
| Abstract: | 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. |
| |
| Keywords: | Look-up table Huffman coding Huffman tree |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
