LZW编码新算法
New LZW Algorithm
本文以LZW变长码设计为研究对象,简要分析和讨论了目前已有的研究和设计方面的缺陷.在著名的LZW数据压缩算法基础上, 提出一种新的数据压缩算法(LZWN算法). LZWN算法大幅度减少了编码的长度,降低了匹配长度取值变化的影响. 对于不同长度及概率分布的输入文件,均可取得最佳编码效率. 新算法采用两个编码器对源数据序列分类编码. 该算法适用压缩各种类型的数据, 完全兼容LZW算法, 并在平均压缩率方面较后者有较大的提高. 并对改进设计进行了分析和论证
Based on researching the design of variable length coding from LZW algorithm, we briefly analyze and discuss the disadvantages of the existed methods. Then, we present a new data compressing algorithm based on the famous LZW, called LZWN algorithm. The new algorithm reduces greatly the length of coding and influence of diversity on match length value. It will become the best coding efficiency for input data of diverse distribution probability. The formed algorithm encodes separately the source data sequence by using two encoders. Our new algorithm is completely compatible with the LZW algorithm, so it can also be used to compress universal data. In the aspect of average compressing ratio, it is better than LZW algorithm. Finally, we analyze the LZWN algorithm, and compare with the original LZW algorithm.
张文亮、刘锋
计算技术、计算机技术
信息论数据压缩LZW算法前缓冲区
Information theoryata compressionLZW algorithmPrefix buffer
张文亮,刘锋.LZW编码新算法[EB/OL].(2008-06-20)[2025-08-16].http://www.paper.edu.cn/releasepaper/content/200806-486.点此复制
评论