Complexity modeling of H.264 entropy decoding

Zhan Ma, Zhongbo Zhang, Yao Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper models the complexity consumption of entropy decoding in a H.264 decoder, which includes many modes such as fix-length code (FLC), variable-length code (ExpGolomb code in particular), content-adaptive variable length code (CAVLC) and content-adaptive binary arithmetic code (CABAC). By analyzing the computations involved in different entropy decoding modes, we derive a complexity model that relates the total complexity with the total bit rate and slice mode (I or P or B). The model is shown to be very accurate when compared with the measured complexity in a PC running the H.264 decoder.

Original languageEnglish (US)
Title of host publication2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings
Pages2784-2787
Number of pages4
DOIs
StatePublished - 2008
Event2008 IEEE International Conference on Image Processing, ICIP 2008 - San Diego, CA, United States
Duration: Oct 12 2008Oct 15 2008

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Other

Other2008 IEEE International Conference on Image Processing, ICIP 2008
CountryUnited States
CitySan Diego, CA
Period10/12/0810/15/08

Keywords

  • Binary arithmetic decoding
  • Complexity modeling
  • H.264
  • Variable length decoding

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Fingerprint Dive into the research topics of 'Complexity modeling of H.264 entropy decoding'. Together they form a unique fingerprint.

Cite this