arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/0601077cs.ITmath.IT
收藏

IDBE --一种基于智能字典的因特网高速文本数据压缩编码算法

IDBE - An Intelligent Dictionary Based Encoding Algorithm for Text Data Compression for High Speed Data Transmission Over Internet

B. S. Shajee Mohan, V. K. Govindan

摘要:

压缩算法减少了数据表示中的冗余,以减少该数据所需的存储。数据压缩提供了一种有吸引力的方法,通过有效地使用可用带宽来降低通信成本。在过去的十年中,通过互联网传输的数字数据量出现了前所未有的爆炸式增长,这些数据代表文本、图像、视频、声音、计算机程序等。随着这一趋势的持续,研究开发能够通过最大限度地压缩数据来最有效地利用可用网络带宽的算法是有意义的。本文的研究重点是解决这个问题的无损压缩的文本文件。无损压缩研究人员已经开发了高度复杂的方法,例如霍夫曼编码、算术编码、Lempel-Ziv族、动态马尔可夫压缩(DMC)、部分匹配预测(PPM)和基于Burrows-Wheeler变换(BWT)的算法。然而,这些方法中没有一种能够一致地达到理论上的最佳情况压缩比,这表明更好的算法是可能的。试图获得更好的压缩比的一种方法是开发新的压缩算法。然而,另一种方法是开发智能的、可逆的转换,这些转换可以应用于源文本,从而提高现有或后端算法的压缩能力。本文探讨了后一种战略。

英文摘要:

Compression algorithms reduce the redundancy in data representation to decrease the storage required for that data. Data compression offers an attractive approach to reducing communication costs by using available bandwidth effectively. Over the last decade there has been an unprecedented explosion in the amount of digital data transmitted via the Internet, representing text, images, video, sound, computer programs, etc. With this trend expected to continue, it makes sense to pursue research on developing algorithms that can most effectively use available network bandwidth by maximally compressing data. This research paper is focused on addressing this problem of lossless compression of text files. Lossless compression researchers have developed highly sophisticated approaches, such as Huffman encoding, arithmetic encoding, the Lempel-Ziv family, Dynamic Markov Compression (DMC), Prediction by Partial Matching (PPM), and Burrows-Wheeler Transform (BWT) based algorithms. However, none of these methods has been able to reach the theoretical best-case compression ratio consistently, which suggests that better algorithms may be possible. One approach for trying to attain better compression ratios is to develop new compression algorithms. An alternative approach, however, is to develop intelligent, reversible transformations that can be applied to a source text that improve an existing, or backend, algorithm's ability to compress. The latter strategy has been explored here.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑