An efficient memory construction scheme for an arbitrary side growing huffman table
Journal
2006 IEEE International Conference on Multimedia and Expo
Journal Volume
2006
Pages
141-144
Date Issued
2006
Author(s)
Abstract
By grouping the common prefix of a Huffman tree, in stead of the commonly used single-side rowing Huffman tree (SGH-tree), 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 SGH-tree 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. © 2006 IEEE.
Other Subjects
Arbitrary-side growing Huffman tree (AGH-tree); Huffman table; Memory construction; Single-side rowing Huffman tree (SGH-tree); Algorithms; Computer simulation; Data storage equipment; Database systems; Trees (mathematics)
Type
conference paper