计算机工程2017，Vol.43Issue(3)：299-303,5.DOI:10.3969/j.issn.1000-3428.2017.03.050
无损压缩算法LZW前缀编码优化及应用
Prefix Encoding Optimization and Application of Lossless Compression Algorithm LZW
摘要
Abstract
LZW algorithm can not make full use of the length of dictionary for prefix encoding when compressing data and has redundancy.When considering the length of the dictionary is l,the prefix can be located within [0,l-1] only,and the LZW algorithm uses [lbl]bit to encode the prefix.Therefore,the data of the interval [l,2[lbl]-1] is not fully used.Aiming at this problem,this paper proposes an improved compression algorithm of prefix mapping encoding.It does not encode and output the prefix which meets the condition,but maps it to the interval [l,2[lbl]-1].In this case,the number of prefix encoding is not decreased but implies the information that the next prefix will be encoded with less bits.Compared with LZW agorithm,the improved algorithm has advantages that it does not increase the amount of calculation and memory space,and can be used more generally in data compression.The effectiveness of the improved algorithm is verified when tested with English text data in simulation experiments and applied into residual data compression.关键词
LZW算法/前缀映射/编码/无损压缩/标志位/去冗余Key words
LZW algorithm/prefix mapping/encoding/lossless compression/flags/redundancy elimination分类
信息技术与安全科学引用本文复制引用
鄢海舟,胥布工,石东江,郑伟德..无损压缩算法LZW前缀编码优化及应用[J].计算机工程,2017,43(3):299-303,5.基金项目
国家自然科学基金-广东联合基金重点项目(U1401253). （U1401253）
