DocumentCode
3410546
Title
Design and analysis of fast text compression based on quasi-arithmetic coding
Author
Howard, Paul G. ; Vitter, Jeffrey Scott
Author_Institution
Dept. of Comput. Sci., Brown Univ., Providence, RI, USA
fYear
1993
fDate
1993
Firstpage
98
Lastpage
107
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
data compression; encoding; word processing; Rice coding; algorithm; compression performance; fast text compression; prediction by partial matching; quasi-arithmetic code tables; Arithmetic; Computer science; Context modeling; Degradation; Encoding; Frequency; NASA; Performance analysis; Table lookup;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 1993. DCC '93.
Conference_Location
Snowbird, UT
Print_ISBN
0-8186-3392-1
Type
conf
DOI
10.1109/DCC.1993.253140
Filename
253140
Link To Document