Title :
Efficient Huffman decoding
Author :
Aggarwal, M. ; Narayan, Ananth
Author_Institution :
Illinois Univ., Urbana, IL
Abstract :
Huffman (1952) codes are being widely used in image and video compression. We propose a decoding scheme coding for Huffman codes, which requires only a few computations per codeword, independent of the number of codewords n, the height of the Huffman tree h, or the length of a codeword. The memory requirement for the proposed scheme depends on the Huffman tree, for sparse Huffman trees (JPEG, H.263, MPEG), it is O(n)
Keywords :
Huffman codes; data compression; decoding; image coding; video coding; H.263; Huffman codes; Huffman tree height; JPEG; MPEG; codeword length; complexity; efficient Huffman decoding; image compression; memory requirement; sparse Huffman trees; two-step algorithm; video compression; Decoding; Electronic mail; Humans; Image coding; Instruments; Internet; Partitioning algorithms; Transform coding; Tree data structures; Video compression;
Conference_Titel :
Image Processing, 2000. Proceedings. 2000 International Conference on
Conference_Location :
Vancouver, BC
Print_ISBN :
0-7803-6297-7
DOI :
10.1109/ICIP.2000.901114
