Arithmetic Coding for Data Compression
View/ Open
Issue Date
1994Author
Howard, Paul G.
Vitter, Jeffrey Scott
Publisher
IEEE
Type
Article
Article Version
Scholarly/refereed, author accepted manuscript
Metadata
Show full item recordAbstract
Arithmetic coding provides an e ective mechanism for remov-
ing redundancy in the encoding of data. We show how arithmetic
coding works and describe an e cient implementation that uses
table lookup as a fast alternative to arithmetic operations. The
reduced-precision arithmetic has a provably negligible e ect on the
amount of compression achieved. We can speed up the implemen-
tation further by use of parallel processing. We discuss the role of
probability models and how they provide probability information
to the arithmetic coder. We conclude with perspectives on the
comparative advantages and disadvantages of arithmetic coding.
Description
(c) 1994 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Collections
Citation
P. G. Howard and J. S. Vitter. “Arithmetic Coding for Data Compression,” invited paper in Proceedings of the IEEE, 82(6), June 1994, 857–865. http://dx.doi.org/10.1109/5.286189
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.