2006 IEEE International Conference on Field Programmable Technology 2006
DOI: 10.1109/fpt.2006.270301
|View full text |Cite
|
Sign up to set email alerts
|

Optimizing the critical loop in the H.264/AVC CABAC decoder

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
14
0
1

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(15 citation statements)
references
References 13 publications
0
14
0
1
Order By: Relevance
“…In [3], memory and look-up tables are reorganized in order to reduce the number of accesses. However, it only focuses on the recursive part, assuming the context number (model in the paper) is automatically supplied.…”
Section: Results Evaluationmentioning
confidence: 99%
“…In [3], memory and look-up tables are reorganized in order to reduce the number of accesses. However, it only focuses on the recursive part, assuming the context number (model in the paper) is automatically supplied.…”
Section: Results Evaluationmentioning
confidence: 99%
“…In their solution Eeckhaut et al 11 have optimized the critical path through both the model selector and the arithmetic decoder. The critical path through the model selector can be kept short by calculating every possible next model in advance.…”
Section: Hardware Solutionsmentioning
confidence: 99%
“…Schematic of the calculations, originally represented by Eeckhaut et al,11 for decoding a result bit (nM ) with model M . For clarity, the schematic has been simplified from the original publication.…”
mentioning
confidence: 99%
“…Though CAVLC is a lot more easy to implement and less power hungry, CAVLC gets the value directly by reading the bit-stream. However with CABAC the complexity is more important as there is a feedback loop between the context modeler and the arithmetic coder [2].…”
Section: Cabac Entropy Decodermentioning
confidence: 99%