BWT与经典压缩算法研究  

Research on BWT and Classical Compression Algorithms

作　　者：倪桂强[1] 李彬[1] 罗健欣[1] 张雪[1] 

机构地区：[1]解放军理工大学指挥自动化学院,南京210007

出　　处：《计算机与数字工程》2010年第11期26-29,41,共5页Computer & Digital Engineering

摘　　要：为提高无损压缩的效果,分析了BWT的基本原理,回顾并比较了霍夫曼编码、算术编码、LZ77和LZW算法的性能,然后把BWT与多阶算术编码、LZW编码结合起来研究,结果表明,对大于BWT分组数据块的文件先经过BWT预处理,再进行压缩,压缩效果明显提高。In order to enhance the effect of lossless compression,the fundamental principle of BWT was analyzed,the basic idea of Huffman,arithmetic coding,LZ77 and LZW were reviewed and their performance were compared,then the research was focus on the combination of BWT with muti-order arithmetic coding and LZW.The research and experimental results indicate that,by using BWT as a preprocessing,the compression effect of the files which are bigger than the block size of BWT is improved remarkably.

关 键 词：数据压缩 BWT 阶 算术编码 LZW 

分 类 号：TN911[电子电信—通信与信息系统]