ecified depending on binIdx as follows: If binIdx is equal to 0, ctxIdxInc is derived by ctxIdxInc = ( ( numDecodAbsLevelGt1 != 0) ? 0: Min( 4, 1 + numDecodAbsLevelEq1)) (9-23) Otherwise (binIdx is greater than 0), ctxIdxInc is derived by ctxIdxInc=5+Min(4-((ctxBlockCat==3)1:0) inumDecodAbsLevelGt1) (9-24) 9.3.3.2 Arithmetic decoding process Inputs to this process are the bypassFlag, ctxIdx as derived in clause 9.3.3.1, and the state variables codIRange and codIOffset of the arithmetic decoding engine. Output of this process is the value of the bin. Figure 9-2 illustrates the whole arithmetic decoding process for a single bin. For decoding the value of a bin, the context index ctxIdx is passed to the arithmetic decoding process DecodeBin(ctxIdx), which is specified as follows: If bypassFlag is equal to 1, DecodeBypass() as specified in clause 9.3.3.2.3 is invoked. Otherwise, if bypassFlag is equal to 0 and ctxIdx is equal to 276, DecodeTerminate() as specified in clause 9.3.3.2.4 is invoked. Otherwise (bypassFlag is equal to 0 and ctxIdx is not equal to 276), DecodeDecision() as specified in clause 9.3.3.2.1 is applied. Rec. ITU-T H.264 (01/2012) DecodeBin(ctxIdx) bypassFlag DecodeBypass ctxIdx==276? DecodeTerminate DecodeDecision(ctxIdx) H.264(09)_F9-2 Figure 9-2 - Overview of the arithmetic decoding process for a single bin (informative) NOTE - Arithmetic coding is based on the principle of recursive interval subdivision. Given a probability estimation p(0) and p( 1) = 1 - p(0 ) of a binary decision (0,1) an initially given code sub-interval with the range codIRange will be subdivided into two sub-intervals having range p( 0) * codIRange and codIRange - p(0) * codIRange, respectively. Depending on the decision, which has been observed, the corresponding sub-interval will be chosen as the new code interval, and a binary code string pointing into that interval will represent the sequence of observed binary decisions. It is useful to distinguish between the most probable symbol (MPS) and the least probable symbol 