Arithmetic Coding for Data Compression

Proceedings of the IEEE

Volumn 82, Issue 6, 1994, Pages 857-865

  Howard, Paul G ^a   Vitter, Jeffrey Scott ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA ACQUISITION; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBABILITY; REDUNDANCY; SIGNAL ENCODING;

ARITHMETIC CODING; REDUNDANCY REMOVAL;

DATA COMPRESSION;

EID: 0028448559     PISSN: 00189219     EISSN: 15582256     Source Type: Journal    
DOI: 10.1109/5.286189     Document Type: Article

References (27)

1. C. E. Shannon, “A mathematical theory of communication,” Bell Syst. Tech. J., vol. 27, pp. 398–403, July 1948.
2. D. A. Huffman, “A method for the construction of minimum redundancy codes,” Proc. IRE, vol. 40, 1098–1101, 1952.
3. T. C. Bell, J. G. Cleary, and I. H. Witten, Text Compression. Englewood Cliffs, NJ: Prentice-Hall, 1990.
4. P. G. Howard and J. S. Vitter, “Analysis of arithmetic coding for data compression,” Informat. Process. Manag., vol. 28, no. 6, 749–763, 1992.
5. I. H. Witten, R. M. Neal, and J. G. Cleary, “Arithmetic coding for data compression,” Common. ACM, vol. 30, no. 6, pp. 520–540, June 1987.
6. R. Pasco, “Source coding algorithms for fast data compression,” Stanford Univ., Ph.D. dissertation, 1976.
7. J. J. Rissanen, “Generalized Kraft inequality and arithmetic coding,” IBM J. Res. Devel., vol. 20, no. 3, pp. 198–203, May 1976.
8. F. Rubin, “Arithmetic stream coding using fixed precision registers,” IEEE Trans. informat. Theory, vol. IT-25, no. 6, pp. 672–675, Nov. 1979.
9. J. J. Rissanen and G. G. Langdon, “Arithmetic coding,” IBM J. Res. Devel., vol. 23, no. 2, 146–162, Mar. 1979.
10. M. Guazzo, “A general minimum-redundancy source-coding algorithm,” IEEE Trans. Informat. Theory, vol. IT-26, no. 1, pp. 15–25, Jan. 1980.
11. W. B. Pennebaker, J. L. Mitchell, G. G. Langdon, and R. B. Arps, “An overview of the basic principles of the Q-coder adaptive binary arithmetic coder,” IBM J. Res. Devel., vol. 32, no. 6, pp. 717–726, Nov. 1988.
12. P. G. Howard and J. S. Vitter, “Practical implementations of arithmetic coding,” in Image and Text Compression, J. A. Storer, Ed. Norwell, MA: Kluwer, 1992, pp. 85–112.
13. “Design and analysis of fast text compression based on quasi-arithmetic coding,” in Proc. Data Compression Conf., J. A. Storer and M. Cohn, Eds. (Snowbird, UT, Mar. 30–Apr. 1, 1993), pp. 98–107.
14. “Parallel lossless image compression using Huffman and arithmetic coding,” in Proc. Data Compression Conf., J. A. Storer and M. Cohn, Eds. (Snowbird, UT, Mar. 24–26, 1992), pp. 299–308.
15. “Fast and efficient lossless image compression,” in Proc. Data Compression Conf., J. A. Storer and M. Cohn, Eds. (Snowbird, UT, Mar. 30–Apr. 1, 1993), 351–360.
16. J. Ziv and A. Lempel, “A universal algorithm for sequential data compression,” IEEE Trans. Informat. Theory, vol. IT-23, no. 3, pp. 337–343, May 1977.
17. “Compression of individual sequences via variable rate coding,” IEEE Trans. Informat. Theory, vol. IT-24, no. 5, pp. 530–536, Sept. 1978.
18. J. G. Cleary and I. H. Witten, “Data compression using adaptive coding and partial string matching,” IEEE Trans. Commun., vol. COM-32, no. 4, 396–402, Apr. 1984.
19. I. H. Witten and T. C. Bell, “The zero frequency problem: Estimating the probabilities of novel events in adaptive text compression,” IEEE Trans. Informat. Theory, vol. IT-37, no. 4, pp. 1085–1094, July 1991.
20. T. C. Hu and A. C. Tucker, “Optimal computer-search trees and variable-length alphabetic codes,” SIAM J. Appl. Math., vol. 21 no. 4, pp. 514–532, 1971.
21. R. M. Neal, “Fast arithmetic coding using low-precision division,” unpublished manuscript, 1987.
22. S. W. Golomb, “Run-length encodings,” IEEE Trans. Informat. Theory, vol. IT-12, no. 4, pp. 399–401, July 1966.
23. R. F. Rice, “Some practical universal noiseless coding techniques,” Jet Propulsion Lab., Pasadena, CA, JPL Pub. 79–22, Mar. 1979.
24. P. Ealis, “Universal codeword sets and representations of integers,” IEEE Trans. Informat. Theory, vol. IT-21, no. 2, pp. 194–203, Mar. 1975.
25. D. W. Jones, “Application of splay trees to data compression,” Commun. ACM, vol. 31, no. 8, pp. 996–1007, Aug. 1988.
26. A. M. Moffat, N. Sharman, I. H. Witten, and T. C. Bell, “An empirical evaluation of coding methods for multi-symbol alphabets,” in Proc. Data Compression Conf., J. A. Storer and M. Cohn, Eds. (Snowbird, UT, Mar. 30-Apr. 1, 1993), pp. 108–117.
27. A. M. Moffat, “Economical inversion of large text files,” presented at Computing Systems 1992.