A Study of a Fast Binary Arithmetic Coder using State Transition Table

Abstract

We have proposed a fast and simple binary arithmetic coder, in which renormalization operations can be done without storing both of the bottom address of the valid interval and renormalized interval, by executing flush operation at the same time. In the flush process, the MPS/LPS interval is carefully divided into the combination of current and succeeding symbols if necessary, to prevent the loss of the coding efficiency. In this report, we will further improve the coding efficiency, allowing the omission of flushing, and shows that it can be implemented by a state transition table. We will also examine the performance of the system having larger register size that improves the efficiency for sources having small LPS probabilities.