Parallel Huffman decoding with applications to JPEG files

Computer Journal

Volumn 46, Issue 5, 2003, Pages 487-497

  Klein, S T ^a   Wiseman, Y ^a,b  

^a BAR ILAN UNIVERSITY   (Israel)

^b JERUSALEM COLLEGE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); IMAGE COMPRESSION; INFORMATION RETRIEVAL; SYNCHRONIZATION;

DECOMPRESSION; HUFFMAN DECODING;

DECODING;

EID: 0042912992     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.5.487     Document Type: Article

References (33)

1. Witten, I. H., Moffat, A. and Bell, T. C. (1994) Managing Gigabytes, Compressing and Indexing Documents and Images. International Thomson Publishingm, London.
2. Bookstein, A. and Klein, S. T. (1993) Is Huffman coding dead? Computing, 50, 279-296.
3. Huffman, D. (1952) A method for the construction of minimum redundancy codes. In Proc. IRE, Kansas City, 9 September 1952, vol. 40, pp. 1098-1101. The Institute of Electronics and Radio Engineers, London.
4. Ziv, J. and Lempel, A. (1977) A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, 23, 337-343.
5. Ziv, J. and Lempel, A. (1978) Compression of individual sequences via variable-rate coding. IEEE Trans. Inform. Theory, 24, 530-536.
6. Bookstein, A., Klein, S. T. and Ziff, D. A. (1992) A systematic approach to compressing a full text retrieval system. Inform. Process. Management, 28, 795-806.
7. Navarro, G. and Raffinot, M. (1999) A general practical approach to pattern matching over Ziv-Lempel compressed text. In Proc. 10th Symp. on Combinatorial Pattern Matching, Warwick, UK, 22-24 July 1999, Lecture Notes in Computer Science, 1645, pp. 14-36. Springer, Berlin.
8. Wallace, G. K. (1991) The JPEG still picture compression standard. Commun. ACM, 34, 30-44.
9. De Agostino, S. and Storer, J. A. (1995) Near optimal compression with respect to a static dictionary on a practical massively parallel architecture. In Proc. Data Compression Conf. DCC-95, Snowbird, Utah, 28-30 March 1995, pp. 172-181. IEEE Computer Society.
10. De Agostino, S. and Storer, J. A. (1992) Parallel algorithms for optimal compression using dictionaries with the prefix property. In Proc. Data Compression Conf. DCC-92, Snowbird, Utah, 24-27 March 1992, pp. 52-61. IEEE Computer Society.
11. Gonzalez Smith, M. E. and Storer, J. A. (1985) Parallel algorithms for data compression. J. ACM, 32(2), 344-373.
12. Hirschberg, D. S. and Stauffer, L. M. (1994) Parsing algorithms for dictionary compression on the PRAM. In Proc. Data Compression Conf. DCC-94, Snowbird, Utah, 29-31 March 1994, pp. 136-145. IEEE Computer Society.
13. Lawrence, L. L. and Przytycka, T. M. (1995) Constructing Huffman Trees in parallel. SIAM J. Comput., 24(6), 1163-1169.
14. Howard, P. G. and Vitter, J. S. (1992) Parallel lossless image compression using Huffman and aithmetic coding. In Proc. Data Compression Conf. DCC-92, Snowbird, Utah, 24-27 March 1992, pp. 299-308. IEEE Computer Society.
15. Gilbert, E. N. and Moore, E. F. (1959) Variable-length binary encodings. Bell Syst. Tech. J., 38, 933-968.
16. Fraenkel, A. S., Mor, M. and Perl, Y. (1983) Is text compression by prefixes and suffixes practical? Acta Inform., 20, 371-389.
17. Fraenkel, A. S. and Klein, S. T. (1990) Bidirectional Huffman coding. Comput. J., 33, 296-307.
18. Klein, S. T. (2000) Skeleton trees for the efficient decoding of Huffman encoded texts. Kluwer J. Inform. Retrieval, 3, 7-23.
19. Ferguson, T. J. and Rabinowitz, J. H. (1984) Self-synchronizing Huffman codes. IEEE Trans. Inform. Theory, 30, 687-693.
20. Lam, W. M. and Kulkarni, S. R. (1996) Extended synchronizing codewords for binary prefix codes. IEEE Trans. Inform. Theory, 42, 984-987.
21. Brodnik, A. and Carlsson, S. (1998) Sublinear Decoding of Huffman Codes Almost in Place. Technical Report 36/600, IMFM, Ljubljana, Slovenia.
22. Vahalia, U. (1996) UNIX Internals-The New Frontiers. Prentice-Hall, Englewood Cliffs, NJ.
23. Bonwick, J. (1994) The slab allocator: an object-caching kernel memory allocator. In Proc. Summer 1994 USENIX Tech. Conf., Boston, Massachusetts, 6-10 June 1994, pp. 87-98. USENIX, Berkeley, CA, 94710, USA.
24. ISO/IEC 10918-1 (1993) Information technology-digital compression and coding of continuous-tone still images requirements and guidelines. International Standard ISO/IEC, Geneva, Switzerland.
25. Rao, K. R. and Yip, P. (1990) Discrete Cosine Transform Algorithms, Advantages, Applications. Academic Press, London.
26. Witten, I. H., Neal, R. M. and Cleary, J. G. (1987) Arithmetic coding for data compression. Comm. ACM, 30, 520-540.
27. Yun, D. Y. Y. and Chen, C. (1996) ESS Project, Annual Report FY96-Applications, NASA, USA Government, Greenbelt, MD.
28. Yun, D. Y. Y. and Chen, C. (1997) ESS Project, Annual Report FY97-Applications, NASA, USA Government, Greenbelt, MD.
29. Marcellin, M. W., Gormish, M. J., Bilgin, A. and Boliek, M. P. (2000) An overview of JPEG-2000. In Proc. Data Compression Conf. DCC-2000, Snowbird, Utah, 28-30 March 2000, pp. 523-541. IEEE Computer Society, New Jersey.
30. Hearn, D. and Baker, M. P. (1986) Computer Graphics, Prentice-Hall, Englewood Cliffs, NJ.
31. Jain, A. K. (1986) Fundamentals of Digital Image Processing, Prentice-Hall, Englewood Cliffs, NJ.
32. Hunt, R. W. G. (1952) The Reproduction of Colour. Morgan, Keene Valley, NY.
33. Laplante, P. A. and Stoyenko, A. D. (1996) Real Time Imaging, Theory, Techniques and Applications. IEEE Press, New York.