Speeding up arithmetic coding using greedy re-normalization
Yunwei Jia, En‐hui Yang, Dake He, S.C. Chan · 2003
Summary form only given. A novel method that significantly reduces the computational complexity of the re-normalization step of arithmetic coding is described. Called greedy re-normalization, the method involves a reduction to both the number of re-normalizations required to encode and the number of operations within each re-normalization. To reduce the number of re-normalizations in the encoding sequence, the method adopts a dynamic re-normalization criterion. Experimental results show that the proposed greedy re-normalization method indeed improved the speed of arithmetic coding.