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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Memory-efficient semi-quasi-arithmetic coding


    Contributors:


    Publication date :

    2005-01-01


    Size :

    92957 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Memory-Efficient Semi-Quasi-Arithmetic Coding

    Hong, D. / Eleftheriadis, A. | British Library Conference Proceedings | 2005


    Static Arithmetic Coding and Dynamic Arithmetic Coding

    Ogata, S. | British Library Online Contents | 2010


    Efficient adaptive arithmetic coding based on updated probability distribution for lossless image compression

    Masmoudi, A. / Puech, W. / Bouhlel, M.S. | British Library Online Contents | 2010