Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding
View/ Open
Issue Date
1994Author
Howard, Paul G.
Vitter, Jeffrey Scott
Publisher
Elsevier
Type
Article
Article Version
Scholarly/refereed, author accepted manuscript
Metadata
Show full item recordAbstract
We give a detailed algorithm for fast text compression. Our algorithm, related to
the PPM method, simpli es the modeling phase by eliminating the escape mechanism
and speeds up coding by using a combination of quasi-arithmetic coding and Rice
coding. We provide details of the use of quasi-arithmetic code tables, and analyze
their compression performance. Our Fast PPM method is shown experimentally to be
almost twice as fast as the PPMC method, while giving comparable compression.
Collections
Citation
P. G. Howard and J. S. Vitter. “Design and Analysis of Fast Text Compression Based on Quasi-Arithmetic Coding,” Journal of Information Processing and Management, 30(6), 1994, 777–790. An extended abstract appears in Proceedings of the 1993 IEEE Data Compression Conference (DCC ’93), Snowbird, UT, April 1993. http://dx.doi.org/10.1016/0306-4573(94)90006-X
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
We want to hear from you! Please share your stories about how Open Access to this item benefits YOU.