An Efficient Memory Construction Scheme for an Arbitrary Side Growing Huffman Table

By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGHtree), we construct a memory efficient Huffman table on the basis of an arbitrary-side growing Huffman tree (AGH-tree) to speed up the Hufman decoding. Simulation results show that, in Huffman decoding, an AGH-tree based Huffman table is 2.35 times faster that of the Hashemian’s method (an SGHtree based one) and needs only one-fifth the corresponding memory size. In summary, a novel Huffman table construction scheme is proposed in this paper which provides better performance than existing construction schemes in both decoding speed and memory usage.

• Type: Conference
• Year: 2006
• Where: ICMCS
• Authors: Sung-Wen Wang, Shang-Chih Chuang, Chih-Chieh Hsiao, Yi-Shin Tung, Ja-Ling Wu
• Keywords: Huffman Table, Huffman Tree, ICMCS 2006, Rowing Huffman Tree