Research on context-based adaptive binary arithmetic coding

To solve the problem of high computational complexity and large memory space in contextbased adaptive binary arithmetic coding (CABAC) of the video coding standard H.264, a new simple encoder scheme was proposed. Theoretical analysis of CABAC entropy coding architecture yielded a formula for calculating the coding efficiency, and optimal quantization point sets for different probabilities were obtained from this formula. After adjusting the precision of the range and scaling factor in the multiplicationfree adaptive binary arithmetic coder in CABAC, the effects of these parameters and the quantization point sets on the coding efficiency and memory space for the CABAC entropy coding were investigated, and the new encoder scheme was then set up. The experimental results on different picture sequences under this scheme show that the memory space and computational complexity can be reduced greatly without much decrease of the coding efficiency. This scheme is efficient in the video communication where less memory space is provided.