Wang, S.-W.S.-W.WangChuang, S.-C.S.-C.ChuangHsiao, C.-C.C.-C.HsiaoTung, Y.-S.Y.-S.TungJA-LING WU2018-09-102018-09-102006https://www.scopus.com/inward/record.uri?eid=2-s2.0-34247616168&doi=10.1109%2fICME.2006.262589&partnerID=40&md5=97a3329ccfb0c327f7649d53da6701c9http://scholars.lib.ntu.edu.tw/handle/123456789/322198By 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.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)conference paper10.1109/ICME.2006.2625892-s2.0-34247616168