首页 | 本学科首页   官方微博 | 高级检索  
     

基于多参数的数据压缩算法
引用本文:高怀远,陈英豪. 基于多参数的数据压缩算法[J]. 微机发展, 2014, 0(9): 41-44
作者姓名:高怀远  陈英豪
作者单位:上海大学自动化系,上海200072
基金项目:基金项目:国家自然科学基金资助项目(71201097)
摘    要:通过对Huffman编码方法的研究,文中提出了一种基于多参数的数据无损压缩算法。基于原始数据集的元素个数统计,对原始数据集进行多次的合并,使合并后所得到的新数据集满足Huffman最佳编码要求,由此生成规模较小的数据合并对应表,并将数据编码分为一元即时码(前缀)和区分码(后缀)两个部分。数据多次合并的不同起始点为文中无损压缩方法的多参数,利用这些参数结合编码前缀及后缀即可唯一表示原始数据,去除了编码表。解码时无需逐位匹配即可复原原始数据。与传统方法相比,文中构造的基于多参数的数据无损压缩方法,编码结构简单,运算开销小,编解码效率较高。

关 键 词:无损压缩  元素合并  1元即时码  区分码

A Lossless Compression Algorithm Based on Multi-parameter
GAO Huai-yuan,CHEN Ying-hao. A Lossless Compression Algorithm Based on Multi-parameter[J]. Microcomputer Development, 2014, 0(9): 41-44
Authors:GAO Huai-yuan  CHEN Ying-hao
Affiliation:( Automation Department of Shanghai University, Shanghai 200072, China)
Abstract:According to the study and analysis of Huffman coding method, propose a kind of lossless compression algorithm which is based on multi-parameter. Through sort and statistical for the number of original data, then merge them to meet the requirement of best Huffman encoding, thereby generating a data merging table which occupies less space, and encode the original data which is divided to one-unit code (prefix code) and distinction code (suffix code). The start point of the data merging is the multi-parameter in this re- search. The original data can be determined by using these parameter. There is no need to bit by bit matching or generating encoding table when decoding. Compared with the original method, the lossless compression algorithm which is based on multi-parameter has simple coding structure and operating. It has higher efficiency in both coding and decoding.
Keywords:lossless compression  element merging  one-unit code  distinction code
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号