基于C语言的自适应Huffman编码算法分析及实现研究  

An algorithm to achieve adaptive Huffman coding with C language

作　　者：文国知[1] 

机构地区：[1]武汉工业学院数理科学系,湖北武汉430023

出　　处：《武汉工业学院学报》2011年第2期53-57,62,共6页Journal of Wuhan Polytechnic University

摘　　要：通过C语言程序,动态统计信源符号概率,逐步构造Huffman编码树,实现了自适应Huffman编码,解决了静态编码树不能根据信源符号的局部变化做出相应变化的主要问题。结果表明,自适应Huffman编码算法压缩率很大,能进一步提高数据传输的效率。The algorithm of adaptive Huffman coding is studied by dynamical statistics of the probability of source symbols and construction of the Huffman coding tree step by step with the C language.A solution is proposed about static source code tree which could not make the corresponding revision when the source symbol changes in the local.The results show that adaptive Huffman coding algorithm could further improve the compression ratio and enhance the efficiency of data transmission.

关 键 词：HUFFMAN编码 自适应 无损压缩 

分 类 号：TN911.21[电子电信—通信与信息系统]