Title :
Condensed Huffman coding, a new efficient decoding technique
Author_Institution :
Northern Illinois Univ., DeKalb, IL, USA
Abstract :
A new technique is proposed for decoding Huffman codes. In this technique a Condensed Huffman Table (CHT) for decoding purposes replaces a typical Huffman table. It is shown that a CHT is much smaller in size and the decoding becomes significantly faster. In an example with a typical Huffman table containing 108 codewords, it is shown that a CHT with only 14 codewords is sufficient to perform the decoding.
Keywords :
Huffman codes; decoding; CHT; Condensed Huffman Table; codewords; condensed Huffman coding; decoding technique; Added delay; Binary trees; Data compression; Data mining; Decoding; Encoding; Entropy coding; Huffman coding; Life members; USA Councils;
Conference_Titel :
Circuits and Systems, 2002. MWSCAS-2002. The 2002 45th Midwest Symposium on
Print_ISBN :
0-7803-7523-8
DOI :
10.1109/MWSCAS.2002.1187198