Proposal of a fast arithmetic coder performing renormalization together with register flush

Abstract

To terminate the code of arithmetic coding, redundancy of at most two bits will be caused by flushing the register. If an arithmetic coder can be flushed at every renormalization timing without redundancy, it can be more fast and simple since it does not need to keep the address and the augend of the probability interval. We propose a fast arithmetic coder which produces no redundancy when the coder is flushed, by dividing the final interval into the plural areas corresponding to the combination of necessary succeeding symbols. However, its coding efficiency can be lowered since it allows the mismatch of the probability and the corresponding area of the probability interval. We report the fundamental performance of our proposed arithmetic coder.