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.
| Original language | English |
|---|---|
| Title of host publication | ICICS-PCM 2003 - Proceedings of the 2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 1483-1487 |
| Number of pages | 5 |
| ISBN (Electronic) | 0780381858, 9780780381858 |
| DOIs | |
| State | Published - 2003 |
| Externally published | Yes |
| Event | Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia, ICICS-PCM 2003 - Singapore, Singapore Duration: 15 12 2003 → 18 12 2003 |
Publication series
| Name | ICICS-PCM 2003 - Proceedings of the 2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia |
|---|---|
| Volume | 3 |
Conference
| Conference | Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia, ICICS-PCM 2003 |
|---|---|
| Country/Territory | Singapore |
| City | Singapore |
| Period | 15/12/03 → 18/12/03 |
Bibliographical note
Publisher Copyright:© 2003 IEEE.