An SGH-Tree based efficient Huffman decoding
Resource
Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint Conference of the Fourth International Conference on
Journal
2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia
Journal Volume
3
Pages
1483-1487
Date Issued
2003
Author(s)
Chuang, Yuh-Jue
Abstract
Huffman code [1] is the most well-known and widely used variable-length codes (VLCs) for compressing various kinds of data. Conventional table lookup and/or bit-serial decoding techniques for realizing VLCs are inefficient in memory usage and/or computation time. In this paper, we investigated some existing memory efficient VLC decoding methods [2, 3, 4, 5] and gave some comments and comparisons among them. We also proposed an SGH-Tree based data structure to implement Aggarwal's approach [5] such that a symbol can be decoded in constant time; moreover, the required memory is much smaller than that of the original approach. © 2003 IEEE.
Other Subjects
Decoding; Multimedia signal processing; Table lookup; Trees (mathematics); Computation time; Constant time; Decoding methods; Decoding techniques; Huffman Decoding; Memory efficient; Tree-based data structures; Variable length codes; Signal processing
Type
conference paper
File(s)![Thumbnail Image]()
Loading...
Name
01292713.pdf
Size
317.15 KB
Format
Adobe PDF
Checksum
(MD5):dbf8ee706e624f2d58e158b04ebe1820