An improved normalization for arithmetic coding

In the fast algorithm of arithmetic coding proposed by Jiang, the normalization is controlled by the width of the coding range and the output codes are in bits style. But the bit-stuffing technique to solve carry propagation problem increases the operation complexity. In this paper we propose a much faster normalization which is also controlled by the width of the coding range but the output codes are in bytes style. Moreover we propose In effective method to solve the carry propagation problem. The same statistical model proposed by P.M.Fenwick is used for experiments and the results show that our algorithm runs much faster than CACM87 and the algorithm of Jiang.