| 基于概率排序的静态奇偶编码压缩算法 |
| |
| 引用本文： | 兰洋,郑高群,李尚柏. 基于概率排序的静态奇偶编码压缩算法[J]. 四川大学学报(自然科学版), 2003, 40(2): 244-250 |
| |
| 作者姓名： | 兰洋 郑高群 李尚柏 |
| |
| 作者单位： | 四川大学原子核科学技术研究所,成都,610064 |
| |
| 摘 要： | 作者针对某些应用数据结构的特点，提出了一种新的基于熵编码原理的压缩算法．该算法使用固定奇偶码，省去了传统算法动态生成哈夫曼树的繁琐过程；从而使算法加速，译码也变得简单，同时又保持了与传统算法基本相当的压缩效率．该算法已在实际应用中取得了满意的效果．
|
| 关 键 词： | 数据压缩 哈夫曼算法 静态奇偶码 熵编码原理 概率排序 静态奇偶编码压缩算法 |
| 文章编号： | 0490-6756(2003)02-0244-07 |
A New Probability Based Parity Encoding Algorithm for Data Compression |
| |
| LAN Yang,ZHENG Gao qun,LI Shang bai. A New Probability Based Parity Encoding Algorithm for Data Compression[J]. Journal of Sichuan University (Natural Science Edition), 2003, 40(2): 244-250 |
| |
| Authors: | LAN Yang ZHENG Gao qun LI Shang bai |
| |
| Abstract: | A new probability based parity encoding algorithm was presented to meet the compression requirement of certain data that has only sixteen different characters. The algorithm uses a fixed set of complementary parity codes to replace the encoding table that dynamically generated by the traditional Huffman method. This simplified and speeded up the encoding and decoding process, and yet maintained about the same encoding efficiency compare with the dynamic algorithm. The application results of the new approach were satisfied. |
| |
| Keywords: | data compression Huffman encoding algorithm static parity codes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
