| 改进的四进制哈夫曼算法 |
| |
| 引用本文： | 胡智宏,尹小正,路立平.改进的四进制哈夫曼算法[J].微型机与应用,2012,31(10):65-66,70. |
| |
| 作者姓名： | 胡智宏 尹小正 路立平 |
| |
| 作者单位： | 郑州轻工业学院电气信息工程学院,河南郑州,450002 |
| |
| 摘 要： | 提出了一种改进的四进制哈夫曼树的生成算法,通过分析算法的平均码长和编码效率,论证了算法相对于传统的四进制算法的优点。并用C语言分别实现两种算法,进行了压缩比和压缩时间的比较,证明了改进算法在压缩比和压缩速度上的提升。
|
| 关 键 词： | 数据压缩 哈夫曼 四叉树 |
An improved quaternary Huffman algorithm |
| |
| Hu Zhihong,Yin Xiaozheng,Lu Liping.An improved quaternary Huffman algorithm[J].Microcomputer & its Applications,2012,31(10):65-66,70. |
| |
| Authors: | Hu Zhihong Yin Xiaozheng Lu Liping |
| |
| Affiliation: | (College of Electric and Information Engineering,Zhengzhou University of Light Industry,Zhengzhou 450002,China) |
| |
| Abstract: | This paper proposed an improved quaternary Huffman tree algorithm,demonstrated the advantages of improved quaternary 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. |
| |
| Keywords: | data compression Huffman quadtree |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
