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

Other

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

Fingerprint

Decoding
Entropy

Keywords

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

ASJC Scopus subject areas

  • Software
  • Computer Vision and Pattern Recognition
  • Signal Processing

Cite this

Ma, Z., Zhang, Z., & Wang, Y. (2008). Complexity modeling of H.264 entropy decoding. In 2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings (pp. 2784-2787). [4712372] https://doi.org/10.1109/ICIP.2008.4712372

Complexity modeling of H.264 entropy decoding. / Ma, Zhan; Zhang, Zhongbo; Wang, Yao.

2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings. 2008. p. 2784-2787 4712372.

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

Ma, Z, Zhang, Z & Wang, Y 2008, Complexity modeling of H.264 entropy decoding. in 2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings., 4712372, pp. 2784-2787, 2008 IEEE International Conference on Image Processing, ICIP 2008, San Diego, CA, United States, 10/12/08. https://doi.org/10.1109/ICIP.2008.4712372
Ma Z, Zhang Z, Wang Y. Complexity modeling of H.264 entropy decoding. In 2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings. 2008. p. 2784-2787. 4712372 https://doi.org/10.1109/ICIP.2008.4712372
Ma, Zhan ; Zhang, Zhongbo ; Wang, Yao. / Complexity modeling of H.264 entropy decoding. 2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings. 2008. pp. 2784-2787
@inproceedings{2d74beb04d0940f8ba9148e9049724d7,
title = "Complexity modeling of H.264 entropy decoding",
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.",
keywords = "Binary arithmetic decoding, Complexity modeling, H.264, Variable length decoding",
author = "Zhan Ma and Zhongbo Zhang and Yao Wang",
year = "2008",
doi = "10.1109/ICIP.2008.4712372",
language = "English (US)",
isbn = "1424417643",
pages = "2784--2787",
booktitle = "2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings",

}

TY - GEN

T1 - Complexity modeling of H.264 entropy decoding

AU - Ma, Zhan

AU - Zhang, Zhongbo

AU - Wang, Yao

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Binary arithmetic decoding

KW - Complexity modeling

KW - H.264

KW - Variable length decoding

UR - http://www.scopus.com/inward/record.url?scp=69949122047&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69949122047&partnerID=8YFLogxK

U2 - 10.1109/ICIP.2008.4712372

DO - 10.1109/ICIP.2008.4712372

M3 - Conference contribution

SN - 1424417643

SN - 9781424417643

SP - 2784

EP - 2787

BT - 2008 IEEE International Conference on Image Processing, ICIP 2008 Proceedings

ER -