Parallel Huffman Decoding with Applications to JPEG Files | Zendy

Shmuel T. Klein | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Parallel Huffman Decoding with Applications to JPEG Files

Author(s) -

Shmuel T. Klein

Publication year - 2003

Publication title -

the computer journal

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.319

H-Index - 64

eISSN - 1460-2067

pISSN - 0010-4620

DOI - 10.1093/comjnl/46.5.487

Subject(s) - huffman coding , canonical huffman code , jpeg , decoding methods , computer science , lossless jpeg , data compression , algorithm , artificial intelligence , image compression , image processing , image (mathematics) , code rate , systematic code

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 compress...

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research