Title :
An efficient Huffman decoding method based on pattern partition and look-up table
Author :
Jiang, Ji-Han ; Chang, Chin-Chen ; Chen, Tung-Shou
Abstract :
An efficient Huffman decoding method is presented in this paper. This new method first partitions a Huffman tree into subtrees by a set of regular bit-patterns. Then, some look-up tables are used to represent these subtrees. Using this method, a Huffman tree can be represented compactly and the decoding of codewords can be performed quickly by the matching of regular bit-patterns.
Keywords :
Huffman codes; decoding; table lookup; tree data structures; Huffman decoding method; Huffman tree; look-up table; pattern partition; regular bit-patterns; subtrees representation; Binary trees; Data compression; Decoding; Huffman coding; Image coding; Pattern matching; Real time systems; Table lookup; Transform coding; Video compression;
Conference_Titel :
Communications, 1999. APCC/OECC '99. Fifth Asia-Pacific Conference on ... and Fourth Optoelectronics and Communications Conference
Conference_Location :
Beijing, China
Print_ISBN :
7-5635-0402-8
DOI :
10.1109/APCC.1999.820409
