Arithmetic coding is the most powerful lossless data compression technique that has attracted
much attention in recent years. This paper presents a new implementation of bit-level arithmetic coding using
integer additions and shifts. The algorithm has less computational complexity and more flexibility, and thus
is very suitable for hardware design. We show that degradation of the proposed algorithm is bounded by
0.2075.
