H.264标准中CAVLC解码的子表-哈夫曼算法  

The Subtable-Huffman algorithm on CAVLC in H.264

作　　者：张宇[1] 

机构地区：[1]同济大学,微电子学与固体电子学上海201804

出　　处：《信息化纵横》2009年第14期58-60,共3页

摘　　要：在分析H.264中CAVLC标准解码算法的基础上提出一种改进算法。此种算法利用子表、哈夫曼树及哈夫曼编码理论,解决了CAVLC标准解码算法查找效率不高的问题。实验表明采用几个简单的码表并对每个码表采用哈夫曼编码可以提升约3倍的效率。Based on the analysis of standard decoding methods of CAVLC in H.264, this paper proposes an improved algorithm. Depending on the theories of subtable, Huffman Tree and Huffman coding, this algorithm improves the standard table look-up decoding efficiency on CAVLC. The testing result shows the Subtable-Huffman algorithm achieves 3 times higher efficiency than the standard one, with some simple subtables and the use of Huffman coding, and can improve more.

关 键 词：H.264 CAVLC 子表 哈夫曼树 哈夫曼编码 

分 类 号：TN919.81[电子电信—通信与信息系统]