An Optimization for CAVLC Code Table Lookup Algorithm in H. 264 Decoder

Author

Lu, Da ; Liu, Guofan ; Zhu, Lingli

Author_Institution

Coll. of Inf. Eng., Xiang Tan Univ., Xiang Tan, China

fYear

2011

fDate

22-23 Oct. 2011

Firstpage

79

Lastpage

82

Abstract

The computational complexity of H.264 video coding standard is two or three times higher than that of H.263 and MPEG-4. Especially, the operation of the entropy coding is one of the most time-consuming parts in the decoder. According to the characteristics of two-dimensional code table for CAVLC, a fast algorithm was proposed in H.264 decoder implementation, which enable different strategies to be made respectively based on the Variable Length Codes and the Fixed Length Codes existing in two-dimensional code table for CAVLC. The computer simulation results indicate that the decoding time of the entropy decode algorithm can be decreased by 75.1%-82.7% than the original algorithm in the H.264 reference software.

Keywords

computational complexity; data compression; decoding; entropy codes; optimisation; table lookup; variable length codes; video coding; CAVLC code table lookup algorithm; H.263; H.264 decoder; H.264 reference software; H.264 video coding standard; MPEG-4; computational complexity; computer simulation; entropy coding; entropy decode algorithm; fixed length codes; two-dimensional code table; variable length codes; Algorithm design and analysis; Binary trees; Computational complexity; Decoding; Entropy; Software; Software algorithms; CAVLC; Entropy Decoding; Fixed Length Codes; H.264/AVC; Variable Length Codes;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligence Information Processing and Trusted Computing (IPTC), 2011 2nd International Symposium on

Conference_Location

Hubei

Print_ISBN

978-1-4577-1130-5

Type

conf

DOI

10.1109/IPTC.2011.27

Filename

6103541