Simplified binary arithmetic coding engine
A method of entropy coding in a video encoder is provided that includes assigning a first bin to a first single-probability bin encoder based on a probability state of the first bin, wherein the first single-probability bin encoder performs binary arithmetic coding based on a first fixed probability state, assigning a second bin to a second single-probability bin encoder based on a probability state of the second bin, wherein the second single-probability bin encoder performs binary arithmetic coding based on a second fixed probability state different from the first fixed probability state, and coding the first bin in the first single-probability bin encoder and the second bin in the second single-probability bin encoder in parallel, wherein the first single-probability bin encoder uses a first rLPS table for the first fixed probability state and the second single-probability bin encoder uses a second rLPS table for the second fixed probability state.
1. A method, comprising:
determining whether a probability state of a first binary symbol is a first fixed probability state;
assigning the first binary symbol to a first single probability binary encoder of a plurality of encoders in response to determining that the probability state of the first binary symbol is the first fixed probability state;
determining whether a probability state of a second binary symbol is a second fixed probability state;
assigning the second binary symbol to a second single probability binary encoder of the plurality of encoders in response to determining that the probability state of the second binary symbol is the second fixed probability state, wherein the second fixed probability state is different from the first fixed probability state; and
coding the first binary symbol in the first single probability binary encoder in parallel with coding the second binary symbol in the second single probability binary encoder, wherein the first single probability binary encoder uses a first range least probably symbol (rLPS) table consisting of bit values for the first fixed probability state and the second single probability binary encoder uses a second rLPS table consisting of bit values for the second fixed probability state, wherein at least one rLPS value in at least one of the first rLPS table and the second rLPS table is quantized based on a resolution reduction of probability states used in assigning bins to single-probability binary symbol encoders.
2. The method of claim 1 , wherein rLPS values for the first fixed probability state and rLPS values for the second probability fixed state are based on rLPS values defined for the first fixed probability state and the second fixed probability state in H.264/AVC.
3. The method of claim 1 , wherein the first rLPS table and the second rLPS table each consist of four rLPS values.
4. The method of claim 1 , wherein the plurality of encoders consists of twelve single-probability binary symbol encoders, wherein each single-probability binary symbol encoder performs binary arithmetic coding based on a different probability state.
5. The method of claim 1 , wherein the probability state of the first binary symbol and the probability state of the second binary symbol are selected from sixty-four probability states.
6. The method of claim 1 , wherein the first rLPS table consists of a first set of rLPS values for the first fixed probability state and the second rLPS table consists of a second set of rLPS values for the second fixed probability state.
7. The method of claim 1 , wherein the first set of rLPS values is different than the second set of rLPS values.
8. The method of claim 1 , wherein the first rLPS table is smaller than 64×4 and the second rLPS table is smaller than 64×4.