摘要
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.
| 原文 | 英語 |
|---|---|
| 主出版物標題 | 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 |
| 發行者 | Institute of Electrical and Electronics Engineers Inc. |
| 頁面 | 1483-1487 |
| 頁數 | 5 |
| ISBN(電子) | 0780381858, 9780780381858 |
| DOIs | |
| 出版狀態 | 已出版 - 2003 |
| 對外發佈 | 是 |
| 事件 | Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia, ICICS-PCM 2003 - Singapore, 新加坡 持續時間: 15 12 2003 → 18 12 2003 |
出版系列
| 名字 | 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 |
|---|---|
| 卷 | 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 |
|---|---|
| 國家/地區 | 新加坡 |
| 城市 | Singapore |
| 期間 | 15/12/03 → 18/12/03 |
文獻附註
Publisher Copyright:© 2003 IEEE.
指紋
深入研究「An SGH-Tree based efficient Huffman decoding」主題。共同形成了獨特的指紋。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver