Parallel lossless image compression using Huffman and arithmetic coding

Information Processing Letters

Volumn 59, Issue 2, 1996, Pages 65-73

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

^a AT AND T LABS RESEARCH   (United States)

^b Duke University   (United States)

Author keywords

Arithmetic coding; Data compression; Huffman coding; Parallel algorithms

Indexed keywords

EID: 30244502325     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00090-7     Document Type: Article

References (21)

1. D. Chevion, E.D. Karnin and E. Walach, High efficiency, multiplication free approximation of arithmetic coding, in: J.A. Storer and J.H. Reif, eds., Proc. Data Compression Conf., Snowbird, UT (1991) 43-52.
2. S. De Agostino and J.A. Storer, Parallel algorithms for optimal compression using dictionaries with the prefix property, in: J.A. Storer and M. Conn, eds., Proc. Data Compression Conf., Snowbird, UT (1992) 52-61.
3. [31 G. Feygin, P.G. Gulak and P. Chow, Minimizing error and VLSI complexity in the multiplication free approximation of arithmetic coding, in: J.A. Storer and M. Cohn, Proc. Data Compression Conf., Snowbird, UT (1993) 118-127.
4. R.G. Gallager and D.C. Van Voorhis, Optimal source codes for geometrically distributed integer alphabets, IEEE Trans. Inform. Theory. 21 (3) (1975) 228-230.
5. M.R. Garey, Optimal binary search trees with restricted maximum depth, SIAM J. Comput. 3 (2) (1974) 101-110.
6. S.W. Golomb, Run-length encodings, IEEE Trans. Inform. Theory. 12 (4) (1966) 399-401.
7. R.W. Hamming, Coding and Information Theory (Prentice Hall, Englewood Cliffs, NJ, 1980).
8. P.G. Howard and J.S. Vitter, New methods for lossless image compression using arithmetic coding, Inform. Process. Management 28 (6) (1992) 765-779.
9. P.G. Howard and J.S. Vitter, Practical implementations of arithmetic coding, in: J.A. Storer, ed., Image and Text Compression (Kluwer Academic Publishers, Norwell, MA, 1992) 85-112.
10. P.G. Howard and J.S. Vitter, Design and analysis of fast text compression based on quasi-arithmetic coding, Inform. Process. Management 30 (6) (1994) 777-794.
11. P.G. Howard and J.S. Vitter, Fast progressive lossless image compression, in: Image and Video Compression Conf., Symp. on Electronic Imaging: Science and Technology, SPIE-2186, San Jose, CA (1994) 98-109.
12. P.G. Howard and J.S. Vitter, Arithmetic coding for data compression, Proc. IEEE 82 (6) (1994) 857-865.
13. P.G. Howard and J.S. Vitter, Error modeling for hierarchical lossless image compression, in: J.A. Storer and M. Cohn, eds., Proc. Data Compression Conf., Snowbird, UT (1992) 269-278.
14. A.K. Huber, A hybrid algorithm for compression of infrared images of space, M.S. Thesis, Utah State University, 1993.
15. D.A. Huffman, A method for the construction of minimum redundancy codes, Proc. Institute of Radio Engineers 40 (1952) 1098-1101
16. A. Moffat, R. Neal and I.H. Witten, Arithmetic coding revisited, in: J.A. Storer and M. Cohn, eds., Proc. Data Compression Conf., Snowbird, UT (1995) 202-211.
17. H. Printz and P. Stubley, Multialphabet arithmetic coding at 16MBytes/sec, in: J.A. Storer and M. Cohn, Proc. Data Compression Conf., Snowbird, UT (1993) 128-137.
18. R.F. Rice, Some practical universal noiseless coding techniques, JPL Publication 79-22, Jet Propulsion Laboratory, Pasadena, CA, 1979.
19. J.J. Rissanen and K.M. Mohiuddin, A multiplication-free multialphabet arithmetic code, IEEE Trans. Comm. 37 (2) (1989) 93-98.
20. D.C. Van Voorhis, Constructing codes with bounded codeword lengths, IEEE Trans. Inform. Theory. 20 (2) (1974) 288-290.
21. I.H. Witten, R.M. Neal and J.G. Cleary, Arithmetic coding for data compression, Comm. ACM 30 (6) (1987) 520-540.