香农编码的优化算法研究  

An Optimized Coding Algorithm of Shannon Code

作　　者：邵军花[1] 刘玉红[1] 邸敬[1] 周东梅[1] 

机构地区：[1]兰州交通大学电子与信息工程学院,甘肃兰州730070

出　　处：《兰州交通大学学报》2010年第6期110-113,共4页Journal of Lanzhou Jiaotong University

基　　金：兰州交通大学校基金(2009-55)

摘　　要：香农编码作为变长信源编码的重要方法之一,具有重要的理论指导意义,但其在实际应用中存在效率较低的缺点.本文针对这一缺陷,通过判断码字之间是否互为前缀来确定码字的方法对其编码算法进行了优化,给出了优化算法的实现步骤,并进行了仿真分析.最后,通过具体实例与仿真分析得出本文提出的优化算法能有效地提高编码效率,特别当信源符号概率大小差距较大时,编码效率提高得尤为显著.Shannon code is one of the important source encodings.Though it has the important theory guidance significance,Shannon code has the defect of lower effectiveness in actual application.In view of this problem,an optimized encoding algorithm is put forward by judging whether the code is the prefix code of the other code or not,and the realization steps of the optimized algorithm and the simulation analysis are presented.At last,through the actual examples and the simulation analysis,the conclusion can be drawn that the optimized encoding algorithm can improve the effectiveness availably,especially when disparity of the probability of source symbols is larger.

关 键 词：香农码 编码效率 优化编码 仿真 

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