This paper describes the construction of computationally efficient transforms which can significantly reduce the complexity of a video decoder without loss in compression efficiency. In particular, these inverse transforms can be implemented using purely 16-bit arithmetic with similar rate-distortion performance to a 32-bit or floating point transform. To allow for variable block size coding, four 2D transforms are considered: one each for 8&8, 8&4, 4&8 and 4&4 blocks respectively. The design criteria for a pure 16 bit arithmetic implementation of the inverse transform are introduced, and used to derive the only useful set of transforms under these conditions. These transforms have been used in the WMV9/VC-1 codec to achieve significant reduction in computational complexity.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Computationally efficient transforms for video coding


    Contributors:


    Publication date :

    2005-01-01


    Size :

    259274 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Computationally Efficient Transforms for Video Coding

    Srinivasan, S. / Regunathan, S. | British Library Conference Proceedings | 2005


    Computationally efficient stochastic coding of speech

    Veeman,D.E. / Mazor,B. / GTE Lab.,US | Automotive engineering | 1990


    Computationally Efficient Multibody Simulations

    Ramakrishnan, J. / Kumar, M. / National Aeronautics and Space Administration | British Library Conference Proceedings | 1994



    Computationally Efficient Control Allocation

    Durham, W. / AIAA | British Library Conference Proceedings | 1999