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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Memory-efficient semi-quasi-arithmetic coding


    Beteiligte:
    Hong, D. (Autor:in) / Eleftheriadis, A. (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    92957 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Memory-Efficient Semi-Quasi-Arithmetic Coding

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


    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




    Pixel pyramid for lossless image compression using Arithmetic Coding

    Ohnesorge, Krystyna / Stucki, Peter / Thomas, Hartwig | AIAA | 1993