A fast binary arithmetic coding using probability table of expanded symbols

The arithmetic coding is known as a highly efficient entropy coding. However, its encoding and decoding are time-consuming due to the symbol-by-symbol arithmetic operations. Several approaches have been proposed to reduce the computation time by replacing the multiplication with the addition, subtraction or shift operation. However, these approximations cause a loss of the coding efficiency. In this paper, we propose a fast binary arithmetic coding by using a precomputed probability table of expanded symbols. Simulation results show that the codec speed, especially the encoding speed, is improved by our method while the coding efficiency is almost same as that of the conventional method.