Title :
Level-compressed Huffman decoding
Author :
Chung, Kuo-Liang ; Wu, Jung-Gen
Author_Institution :
Dept. of Inf. Manage. & Inst. of Inf. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan
fDate :
10/1/1999 12:00:00 AM
Abstract :
Based on the breadth-first search manner and the level-compression technique, this article first presents a new array data structure to represent the classical Huffman (1952) tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the proposed method. In fact, the proposed algorithm can be applied to the canonical Huffman tree
Keywords :
Huffman codes; data compression; data structures; decoding; image coding; search problems; trees (mathematics); array data structure; breadth-first search; canonical Huffman tree; classical Huffman tree; decoding algorithm; decoding time; experiment; image decoding; level-compressed Huffman decoding; level-compression technique; memory; Communications Society; Computer science education; Councils; Data compression; Data structures; Decoding; Frequency; Information management; Table lookup; Tree data structures;
Journal_Title :
Communications, IEEE Transactions on
