转 一种新的累积频率表的数据结构.docVIP

转 一种新的累积频率表的数据结构 [转]一种新的累积频率表的数据结构2010-03-30 14：23A New Data Structure for Cumulative Frequency Tables一种新的累积频率表的数据结构 PETER M.FENWICK Department of Computer Science,University of Auckland,Private Bag 92019,Auckland,New Zealand(email：p_fenwick@cs.auckland.ac.nz) SUMMARY概要 A new method(thebinary indexed tree)is presented for maintaining the cumulative frequencies which are needed to support dynamic arithmetic data compression.It is based on adecomposition of the cumulative frequencies into portions which parallel the binary representation of the index of the table element(or symbol).The operations to traverse the data structure are based on the binary coding of the index.In comparison with previous methods,the binary indexed tree is faster,using more compact data and simpler code.The access time for all operations is either constant or proportional to the logarithm of the table size.In conjunction with the compact data structure,this makes the new method particularly suitable for large symbol alphabets. 一种新的方法(二进制索引树)是提出了维持所需要的支持动态数据压缩算法的累积频率。它是根据累积频率部分分解成平行的表元素(或符号)索引的二进制表示。遍历的业务数据结构上的索引的二进制编码的。与以前的方法相比，二进制索引树的速度更快，使用更紧凑的数据和简单的代码。对所有业务的访问时间要么是不变，或成比例表的大小数。在与数据结构紧凑的结合，这使得新方法，特别是适合大字母符号。 KEY WORDS：Binary indexed tree Arithmetic coding Cumulative frequencies 关键词：二进制索引树，算术编码，累积频率 INTRODUCTION引言 A major cost in adaptive arithmetic data compression is the maintenance of the table of cumulative frequencies which is needed in reducing the range for successive symbols.Witten,Neal and Cleary[1]ease the problem by providing amove-to-front mapping of the symbols which ensures that the most frequent symbols are kept near the front of the search space.It works well for highly skewed alphabets(which may be expected to compress well)but is much less efficient for more uniform distributions of symbol frequency.Moffat[2]describes atree structure(actually aheap)which provides alinear-time access to all symbols.Jones[3]uses splay trees to provide an optimized data structure for handling