Data Compression with Finite Windows

Edward R. Fiala, Daniel H.Greene

Communications of the ACM, vol.32, N4 1989, pp.490-505

Several methods are presented for adaptive, invertible data compression in the style of Lempel's and Ziv's first textual substitution proposal. For the first two methods, the article describes modifications of McCreight's suffix tree data structure that support cyclic maintenance of a window on the most recent source characters. A percolating update is used to keep node positions within the window, and the updating process is shown to have constant amortized cost. Other methods explore the tradeoffs between compression time. expansion time, data structure size, and amount of compression achieved. The article includes a graph-theoretic analysis of the compression penalty incurred by our codeword selection policy in comparision with an optimal policy, and it includes emperical studies of the performance of various adaptive compressors from the literature.

page 490, page 491, page 492, page 493, page 494, page 495, page 496, page 497, page 498, page 499, page 500, page 501, page 502, page 503, page 504, page 505.
Изменена 19.03.2011 06:45 MSK Яндекс цитирования Рейтинг   quill