改进的四进制哈夫曼算法  

An improved quaternary Huffman algorithm

作　　者：胡智宏[1] 尹小正[1] 路立平[1] 

机构地区：[1]郑州轻工业学院 电气信息工程学院,河南郑州450002

出　　处：《微型机与应用》2012年第10期65-66,70,共3页Microcomputer & Its Applications

摘　　要：提出了一种改进的四进制哈夫曼树的生成算法,通过分析算法的平均码长和编码效率,论证了算法相对于传统的四进制算法的优点。并用C语言分别实现两种算法,进行了压缩比和压缩时间的比较,证明了改进算法在压缩比和压缩速度上的提升。This paper proposed an improved quaternary Huffman tree algorithm, demonstrated the advantages of improved qua- ternary algorithm by analyzing the average code length and coding efficiency compared to conventional quaternary algorithms. And implemented the two algorithms by C language ,made a comparison between the two algorithms in ratio and compression time, proved algorithm compression ratio and compression speed of the upgrade.

关 键 词：数据压缩 哈夫曼 四叉树 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]