https://scholars.lib.ntu.edu.tw/handle/123456789/338966
標題: | Memory efficient hierarchical lookup tables for mass arbitrary-side growing huffman trees decoding | 作者: | Wang, S.-W. Chuang, S.-C. Hsiao, C.-C. Tung, Y.-S. JA-LING WU |
關鍵字: | Audio/video decoding; Huffman decoding; Tree data structure | 公開日期: | 2008 | 卷: | 18 | 期: | 10 | 起(迄)頁: | 1335-1346 | 來源出版物: | IEEE Transactions on Circuits and Systems for Video Technology | 摘要: | This paper addresses the optimization problem of minimizing the number of memory access subject to a rate constraint for any Huffman decoding of various standard codecs. We propose a Lagrangian multiplier based penalty-resource metric to be the targeting cost function. To the best of our knowledge, there is few related discussion, in the literature, on providing a criterion to judge the approaches of entropy decoding under resource constraint. The existing approaches which dealt with the decoding of the single-side growing Huffman tree may not be memory-efficient for arbitrary-side growing Huffman trees adopted in current codecs. By grouping the common prefix part of a Huffman tree, in stead of the commonly used single-side growing Huffman tree, we provide a memory efficient hierarchical lookup table to speed up the Huffman decoding. Simulation results show that the proposed hierarchical table outperforms previous methods. A Viterbi-like algorithm is also proposed to efficiently find the optimal hierarchical table. More importantly, the Viterbi-like algorithm obtains the same results as that of the brute-force search algorithm. © 2008 IEEE. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-55149114407&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/338966 |
DOI: | 10.1109/TCSVT.2008.920968 |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。