基于中心极限定理的信源序列的霍夫曼编码方法  

Huffman Coding Method for Source Sequence Based on Central Limit Theorem

作　　者：彭凯军[1] 张明亮 蔡有成 沈路航 PENG Kai jun;ZHANG Ming liang;CAI You cheng;SHEN Lu hang(School of Mathematics, Hefei University of Technology, Hefei 230009, China)

机构地区：[1]合肥工业大学数学学院,合肥230009

出　　处：《大学数学》2017年第5期28-33,共6页College Mathematics

基　　金：安徽省大学生创新创业训练项目(2017CXCYS160);唐烁名师工作室;合肥工业大学校级教改项目(XJKC201320)

摘　　要：借助中心极限定理,提出一种限失真霍夫曼编码方法.首先对信源扩展序列自信息量采用标准化,并定义其为标准信息量.根据中心极限定理,提出一类α-经典序列.然后将其作为编码序列进行霍夫曼编码.接着证明了α-经典序列霍夫曼编码具有较高的编码效率、较低的编码复杂度等一系列良好的性质.最后文中通过实例对扩展信源和其α-经典序列两种编码进行了比较,验证了上述结论.Based the central limit theorem,a limited distortion Huffman encoding method has been proposed.First,through standardizing the self information of the Nth extension information source,we define a standard self information.Then based on the central limit theorem,αClassical sequence of extended source was defined,and it has been encoded by using Huffman as encoding sequence.Then it’s proved that the Huffman encoding ofαClassical sequence has many well properties such as higher encoding efficiency and lower encoding complexity.In this paper,we compare two kinds of coding of extended source and its classical sequence in order to validate conclusion above.

关 键 词：中心极限定理 霍夫曼编码 标准信息量 α-经典序列 

分 类 号：O236.2[理学—运筹学与控制论]