https://scholars.lib.ntu.edu.tw/handle/123456789/302008
標題: | An SGH-Tree based efficient Huffman decoding | 作者: | Chuang, Yuh-Jue JA-LING WU |
公開日期: | 2003 | 卷: | 3 | 起(迄)頁: | 1483-1487 | 來源出版物: | 2003 Joint Conference of the 4th International Conference on Information, Communications and Signal Processing and 4th Pacific-Rim Conference on Multimedia | 摘要: | 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. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-33744793050&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/302008 |
DOI: | 10.1109/ICICS.2003.1292713 | SDG/關鍵字: | 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 |
顯示於: | 資訊工程學系 |
檔案 | 描述 | 大小 | 格式 | |
---|---|---|---|---|
01292713.pdf | 317.15 kB | Adobe PDF | 檢視/開啟 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。