无损压缩CTW算法的改进及性能分析

在有限的传输带宽下传输数据时,传输率受到限制,如何高效地压缩传输数据,以便减少存储空间和传输时间,已经成为迫切需要解决的问题。本文在一种无损数据压缩算法CTW(context tree weight)的基础上,提出了改进的CTW算法。该算法采用了新的更低冗余度的概率估算法,并继承了CTW算法所具有的速度快和抗差错能力强等特点,与通用压缩软件Winzip相比能够获得更好的压缩率,从而保证了实时处理的可行性。本文基于对实际数据的实验,针对此算法的工作原理进行了综述,并提出了扩展和进一步研究的建议。

Improved CTW algorithm of lossless data compression and its performance analysis

It is restricted to transmit data on limited bandwidth,so it is important to resolve the problem of how to compress the data in high effect so that the storage space and transmission time would be reduced.This paper proposes an ameliorated CTW algorithm based on CTW alorithm which is a sort of lossless data compression algorithm.This alorithm uses new probability estimation algorithm to reduce the redundancy,and inherits its characters of fast processing speed and strong anti-error capacity.Compared to popular compression software,which is Winzip,the Ameliorated CTW Algorithm can acquire better compression rate,and guarantee the feasibility on real-time operation.Basing on the operation on actual data,this paper describes the task principle,and indicates some suggestions for development and further research.