Arithmetic coding revisited

ACM Transactions on Information Systems

Volumn 16, Issue 3, 1998, Pages 256-294

  Moffat, Alistair ^a   Neal, Radford M ^b   Witten, Ian H ^c  

^a UNIVERSITY OF MELBOURNE   (Australia)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF WAIKATO   (New Zealand)

Author keywords

Algorithms; Approximate coding; Arithmetic coding; E.1 Data : Data Structures; E.4 Data : Coding and Information Theory data compaction and compression; Performance; Text compression; Word based model

Indexed keywords

ARITHMETIC CODING; TEXT COMPRESSION; WORD BASED MODEL;

CODES (SYMBOLS); DATA COMPRESSION; DATA STRUCTURES; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; PROBABILITY;

ENCODING (SYMBOLS);

EID: 0032108353     PISSN: 10468188     EISSN: None     Source Type: Journal    
DOI: 10.1145/290159.290162     Document Type: Article

References (48)

1. BELL, T. C., CLEARY, J. G., AND WITTEN, I. H. 1990. Text Compression. Prentice-Hall, Inc., Upper Saddle River, NJ.
2. BENTLEY, J. L., SLEATOR, D. D., TARJAN, R. E., AND WEI, V. K. 1986. A locally adaptive data compression scheme. Commun. ACM 29, 4 (Apr.), 320-330.
3. BOOKSTEIN, A. AND KLEIN, S. T. 1993. Is Huffman coding dead?. Computing 50, 4, 279-296.
4. BURROWS, W. AND WHEELER, D. J. 1994. A block-sorting lossless data compression algorithm. Tech. Rep. 124. Digital Equipment Corp., Maynard, MA.
5. CAPOCELLI, R. M. AND DE SANTIS, A. 1991. New bounds on the redundancy of Huffman codes. IEEE Trans. Inf. Theor. IT-37, 1095-1104.
6. CHEVION, D., KARNIN, E. D., AND WALACH, E. 1991. High efficiency, multiplication free approximation of arithmetic coding. In Proceedings of the 1991 IEEE Data Compression Conference, J. A. Storer and J. Reif, Eds. IEEE Computer Society Press, Los Alamitos, CA, 43-52.
7. CLEARY, J. G. AND WITTEN, I. H. 1984. Data compression using adaptive coding and partial string matching. IEEE Trans. Commun. COM-32, 396-402.
8. CORMACK, G. V. AND HORSPOOL, R N. 1984. Algorithms for adaptive Huffman codes. Inf. Process. Lett. 18, 3 (Mar.), 159-165.
9. CORMACK, G. V. AND HORSPOOL, R. N. 1987. Data compression using dynamic Markov modelling. Comput. J. 30, 6 (Dec.), 541-550.
10. CORMEN, T. H., LEISERSON, C. E., AND RIVEST, R. L. 1990. Introduction to Algorithms. MIT Press, Cambridge, MA.
11. FENWICK, P. M. 1994. A new data structure for cumulative frequency tables. Softw. Pract. Exper. 24, 3 (Mar.), 327-336.
12. FEYGIN, G., GULAK, P. G., AND CHOW, P. 1994. Minimizing excess code length and VLSI complexity in the multiplication free approximation of arithmetic coding. Inf. Process. Manage. 30, 6, 805-816.
13. GALLAGER, R. G. 1978. Variations on a theme by Huffman. IEEE Trans. Inf. Theor. IT-24, 6 (Nov.), 668-674.
14. GALLAGER, R. G. AND VAN VOORHIS, D. C. 1975. Optimal source codes for geometrically distributed integer alphabets. IEEE Trans. Inf. Theor. IT-21, 2 (Mar.), 228-230.
15. GOLOMB, S. W. 1966. Run-length encodings. IEEE Trans. Inf. Theor. IT-12, 3 (July), 399-401.
16. HAMAKER, D. 1988. Compress and compact discussed further. Commun. ACM 31, 9 (Sept.), 1139-1140.
17. HARMAN, D. K. 1995. Overview of the second text retrieval conference (TREC-2). Inf. Process. Manage. 31, 3 (May-June), 271-289.
18. HORSPOOL, R. N. AND CORMACK, G. V. 1992. Constructing word-based text compression algorithms. In Proceedings of the 1992 IEEE Data Compression Conference, J. Storer and M. Cohn, Eds. IEEE Computer Society Press, Los Alamitos, CA, 62-71.
19. HOWARD, P. G. AND VITTER, J. S. 1992. Analysis of arithmetic coding for data compression. Inf. Process. Manage. 28, 6 (Nov.-Dec.), 749-763.
20. HOWARD, P. G. AND VITTER, J. S. 1994. Arithmetic coding for data compression. Proc. IEEE 82, 6, 857-865.
21. HUFFMAN, D. A. 1952. A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng. 40, 9 (Sept.), 1098-1101.
22. JIANG, J. 1995. Novel design of arithmetic coding for data compression. IEE Proc. Comput. Dig. Tech. 142, 6 (Nov.), 419-424.
23. JONES, D. W. 1988. Application of splay trees to data compression. Commun. ACM 31, 8 (Aug.), 996-1007.
24. KNUTH, D. E. 1985. Dynamic Huffman coding. J. Alg. 6, 2 (June), 163-180.
25. KUHN, M. 1996. Implementation of JBIG (including a QM-coder). ftp://ftp.informatik. uni-erlangen.de/pub/doc/ISO/JBIG/jbigkit-0.9.tar.gz
26. LANGDON, G. G. 1984. An introduction to arithmetic coding. IBM J. Res. Dev. 28, 2 (Mar.), 135-149.
27. LANGDON, G. G. AND RISSANEN, J. 1981. Compresson of black-and-white images with arithmetic coding. IEEE Trans. Commun. COM-29, 858-867.
28. MANSTETTEN, D. 1992. Tight upper bounds on the redundancy of Huffman codes. IEEE Trans. Inf. Theor. 38, 1 (Jan.), 144-151.
29. MOFFAT, A. 1989. Word-based text compression. Softw. Pract. Exper. 19, 2 (Feb.), 185-198.
30. MOFFAT, A. 1990a. Implementing the PPM data compression scheme. IEEE Trans. Commun. 38, 11 (Nov.), 1917-1921.
31. MOFFAT, A. 1990b. Linear time adaptive arithmetic coding. IEEE Trans. Inf. Theor. 36, 2 (Mar.), 401-406.
32. MOFFAT, A. 1997. Critique of "Novel design of arithmetic coding for data compression". IEE Proc. Comput. Digit. Tech.
33. MOFFAT, A. AND TURPIN, A. 1997. On the implementation of minimum-redundancy prefix codes. IEEE Trans. Commun. 45, 10 (Oct.), 1200-1207.
34. MOFFAT, A., SHARMAN, N., WITTEN, I. H., AND BELL, T. C. 1994. An empirical evaluation of coding methods for multi-symbol alphabets. Inf. Process. Manage. 30, 6, 791-804.
35. PENNEBAKER, W. B., MITCHELL, J. L., LANGDON, G. G., AND ARPS, R. B. 1988. An overview of the basic prinicples of the Q-coder adaptive binary arithmetic coder. IBM J. Res. Dev. 32, 6 (Nov.), 717-726.
36. RISSANEN, J. 1976. Generalised Kraft inequality and arithmetic coding. IBM J. Res. Dev. 20, 198-203.
37. RISSANEN, J. AND LANGDON, G. G. 1979. Arithmetic coding. IBM J. Res. Dev. 23, 2 (Mar.), 149-162.
38. RISSANEN, J. AND LANGDON, G. G. 1981. Universal modeling and coding. IEEE Trans. Inf. Theor. IT-27, 1 (Jan.), 12-23.
39. RISSANEN, J. AND MOHIUDDIN, K. M. 1989. A multiplication-free multialphabet arithmetic code. IEEE Trans. Comm. 37, 2 (Feb.), 93-98.
40. RUBIN, F. 1979. Arithmetic stream coding using fixed precision registers. IEEE Trans. Inf. Theor. IT-25, 6 (Nov.), 672-675.
41. SCHINDLER, M. 1998. A fast renormalisation for arithmetic coding. In Proceedings of the 1998 IEEE Data Compression Conference (Snowbird, UT), J. A. Storer and M. Cohn, Eds. IEEE Computer Society Press, Los Alamitos, CA, 572.
42. SHANNON, C. E. 1948. A mathematical theory of communication. Bell Syst. Tech. J. 27, 79-423.
43. VITTER, J. S. 1987. Design and analysis of dynamic Huffman codes. J. ACM 34, 4 (Oct.), 825-845.
44. WITTEN, I. H. AND BELL, T. C. 1991. The zero frequency problem: Estimating the probabilities of novel events in adaptive text compression. IEEE Trans. Inf. Theor. 37, 4 (July), 1085-1094.
45. WITTEN, I. H., MOFFAT, A., AND BELL, T. C. 1994. Managing Gigabytes: Compressing and Indexing Documents and Images. Van Nostrand Reinhold Co., New York, NY.
46. WITTEN, I. H., NEAL, R. M., AND CLEARY, J. G. 1987. Arithmetic coding for data compression. Commun. ACM 30, 6 (June), 520-540.
47. WITTEN, I. H., NEAL, R. M., AND CLEARY, J. G. 1988. Authors' response to "Compress and Compact discussed further". Commun. ACM 31, 9 (Sept.), 1140-1145.
48. ZIV, J. AND LEMPEL, A. 1977. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. IT-23, 3, 337-343.