The Joint Collaborative Team on Video Coding (jct-vc) of itu-t wp3/16 and iso/iec jtc 1/sc 29/wg 11 held its second meeting during 21-28 July, 2010 at the itu-t premises in Geneva, ch


JCTVC-B088 [M. Budagavi, M. U. Demircin (TI)] Parallel context processing techniques for high coding efficiency entropy coding in HEVC



Yüklə 402,98 Kb.
səhifə31/127
tarix09.01.2022
ölçüsü402,98 Kb.
#92585
1   ...   27   28   29   30   31   32   33   34   ...   127
JCTVC-B088 [M. Budagavi, M. U. Demircin (TI)] Parallel context processing techniques for high coding efficiency entropy coding in HEVC

Context-Adaptive Binary Arithmetic Coding (CABAC) is one of two entropy engines used by the AVC video coding standard. Processing in CABAC engine is highly serial in nature. Consequently, in order to decode high bit rate video bit-streams in real-time, the CABAC engine needs to be run at extremely high frequencies which consumes a significant amount of power and in the worst case may not be feasible. Several techniques to parallelize CABAC were proposed in different contributions in response to CfP at the last JCT-VC meeting. The parallelism proposed in those contributions can be broadly classified into three categories: bin-level parallelism, syntax element-level parallelism, and slice-level parallelism. The bin-level parallelism techniques such as NBAC/PIPE/V2V parallelize binary arithmetic coder (BAC) of CABAC. However, due to serial bottlenecks in context processing, there is limited overall throughput improvement in the entropy coder. Hence techniques that parallelize context processing and binarization are required. This contribution presents the following three different techniques for parallelization of context processing (PCP) for improving throughput of the whole entropy coder: Coefficient Sign PCP, Coeff Level BinIdx 0 PCP, significance map PCP. In addition, this contribution also explains the advantages of syntax element partitioning from perspective of parallelization of binarizer and context processing.

Syntax element parallelism.

Three parallel context processing techniques: coefficient sign, coefficient level bin index 0, and significance map.

Binarizer and context modeller need to be parallelized. Possibilities: A) Syntax element partitioning. B) Parallel context processing, e.g. significance, sign, level of coeffs in case binidx=0. Sign to be sent in a separate plane.Significance map: Significant coeff flag and last coef flag: If last cannot be sent at any place, throughput is increased, but slight increase in bit rate due to necessity to send more significant coeff flags.


Yüklə 402,98 Kb.

Dostları ilə paylaş:
1   ...   27   28   29   30   31   32   33   34   ...   127




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©muhaz.org 2024
rəhbərliyinə müraciət

gir | qeydiyyatdan keç
    Ana səhifə


yükləyin