Memory-efficient semi-quasi-arithmetic coding

A highly efficient, lookup table-based, renormalization method is proposed, which can be used by any binary arithmetic coder with the follow-on procedure. It replaces the time-consuming branching operations in the renormalization process with table lookups and some simple bit-wise operations. We show that the proposed method is much faster than the one used by the M coder in the CABAC entropy coding scheme of the H.264 video coding standard. Our method requires much less memory than the previously known, table-based quasi-coder.