Skip Navigation

The Computer Journal 2003 46(5):487-497; doi:10.1093/comjnl/46.5.487
© 2003 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Klein, S. T.
Right arrow Articles by Wiseman, Y.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Parallel Huffman Decoding with Applications to JPEG Files

S. T. Klein1 and Y. Wiseman1,2

1 Department of Computer Science, Bar Ilan University, Ramat Gan 52900, Israel Email: tomi@cs.biu.ac.il, wiseman@cs.biu.ac.il 2 Computer Science Department, Jerusalem College of Technology, Jerusalem 91160, Israel

A simple parallel algorithm for decoding a Huffman encoded file is presented, exploiting the tendency of Huffman codes to resynchronize quickly, i.e. recovering after possible decoding errors, in most cases. The average number of bits that have to be processed until synchronization is analyzed and shows good agreement with empirical data. As Huffman coding is also a part of the JPEG image compression standard, the suggested algorithm is then adapted to the parallel decoding of JPEG files.

* This is an extended version of a paper that appeared earlier in Klein, S. T. and Wiseman, Y. (2000) Proc. Data Compression Conf. DCC'00, Snowbird, Utah, pp. 383–392. IEEE Computer Society Press, Los Alamitos, CA.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.