Design and analysis of fast text compression based on quasi-arithmetic coding
- 31 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A detailed algorithm for fast text compression, related to the PPM method, simplifies the modeling phase by eliminating the escape mechanism, and speeds up coding by using a combination of quasi-arithmetic coding and Rice coding. The authors provide details of the use of quasi-arithmetic code tables, and analyze their compression performance. The Fast PPM method is shown experimentally to be almost twice as fast as the PPMC method, while giving comparable compression.Keywords
This publication has 4 references indexed in Scilit:
- Fast and efficient lossless image compressionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Practical Implementations of Arithmetic CodingPublished by Springer Nature ,1992
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- Data Compression Using Adaptive Coding and Partial String MatchingIEEE Transactions on Communications, 1984