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.
Memory-efficient semi-quasi-arithmetic coding
01.01.2005
92957 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Memory-Efficient Semi-Quasi-Arithmetic Coding
British Library Conference Proceedings | 2005
|Static Arithmetic Coding and Dynamic Arithmetic Coding
British Library Online Contents | 2010
|British Library Online Contents | 2010
|Bit-Wise Arithmetic Coding For Compression Of Data
NTRS | 1996
|Bit-Wise Arithmetic Coding for Compression of Data
Online Contents | 1996