基于概率排序的静态奇偶编码压缩算法  

A New Probability Based Parity Encoding Algorithm for Data Compression

作　　者：兰洋[1] 郑高群[1] 李尚柏[1] 

机构地区：[1]四川大学原子核科学技术研究所,成都610064

出　　处：《四川大学学报（自然科学版）》2003年第2期244-250,共7页Journal of Sichuan University(Natural Science Edition)

摘　　要：作者针对某些应用数据结构的特点 ,提出了一种新的基于熵编码原理的压缩算法 .该算法使用固定奇偶码 ,省去了传统算法动态生成哈夫曼树的繁琐过程 ;从而使算法加速 ,译码也变得简单 ,同时又保持了与传统算法基本相当的压缩效率 .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.

关 键 词：数据压缩 哈夫曼算法 静态奇偶码 熵编码原理 概率排序 静态奇偶编码压缩算法 

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