论文部分内容阅读
通用和自适应的数据压缩技术具有压缩各类意据而不丢失信息的能力。但是!这种技术复杂且计算速度慢。由硬件速度的提高及计算成本的下降,使通用数据压缩的应用成为可能。该文对自适应Huffman和Lempel一Ziv压缩算法进行了性能评估,对大小不同的意据文件的压缩比和运行时问关系作了图示并进行了讨论,大体给出了些算法为获得相对于理论上可实现的极限的最佳:峰能所需的调整。
Common and adaptive data compression technology has the ability to compress various kinds of claims without losing information. However, this technique is complex and computationally slow. By increasing the speed of the hardware and the declining computational cost, the application of general data compression becomes possible. In this paper, the performance of adaptive Huffman and Lempel-Ziv compression algorithm is evaluated. The relationship between compression ratio and runtime of different size files is illustrated and discussed, and some algorithms are given to obtain the relative The theoretically achievable limit of the best: the peak energy needed to adjust.