Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Data compression with finite windows

Data compression with finite windows RESEARCHCONTRlBllTlONS Algorithms and Data Structures Daniel Sleator Editor Data Compression with Finite Windows EDWARDR. FIALA and DANIEL H. GREENE ABSTRACT: Sevt,ral methods are presented for adaptive, invertible data complression 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 strut ture that support cyclic maintenance of a window on the most recent source characters. A percolating update i:; 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 selt ™ction policy in comparison with an optimal policy, and It includes empirical studies of the performance of various adaptive compressors from the literature. 1. INTRODUCTION Compression is the coding of data to minimize its representation. In this al,ticle, we are concerned with fast, one-pass, adaptive, invertible (or lossless) methods of digital compression which have reasonable memory requirements. SUCK.methods can be used, for example, to reduce the storal;e requirements for files, http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Communications of the ACM Association for Computing Machinery

Data compression with finite windows

Communications of the ACM , Volume 32 (4) – Apr 1, 1989

Loading next page...
 
/lp/association-for-computing-machinery/data-compression-with-finite-windows-lmCcddeWgj

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 1989 by ACM Inc.
ISSN
0001-0782
DOI
10.1145/63334.63341
Publisher site
See Article on Publisher Site

Abstract

RESEARCHCONTRlBllTlONS Algorithms and Data Structures Daniel Sleator Editor Data Compression with Finite Windows EDWARDR. FIALA and DANIEL H. GREENE ABSTRACT: Sevt,ral methods are presented for adaptive, invertible data complression 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 strut ture that support cyclic maintenance of a window on the most recent source characters. A percolating update i:; 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 selt ™ction policy in comparison with an optimal policy, and It includes empirical studies of the performance of various adaptive compressors from the literature. 1. INTRODUCTION Compression is the coding of data to minimize its representation. In this al,ticle, we are concerned with fast, one-pass, adaptive, invertible (or lossless) methods of digital compression which have reasonable memory requirements. SUCK.methods can be used, for example, to reduce the storal;e requirements for files,

Journal

Communications of the ACMAssociation for Computing Machinery

Published: Apr 1, 1989

References