A unified approach to the fast computation of evenly and oddly stacked modified discrete cosine transform (MDCT) and modified discrete sine transform (MDST) is presented. Although the evenly and oddly stacked MDCT/MDST are quite different filter banks, there exists an intimate relation between them, and consequently, the efficient oddly stacked MDCT/MDST computation can be realized via the evenly stacked MDCT/MDST and vice versa only by simple preprocessing and postprocessing of input and output data sequences. In particular, it is shown that the transposed evenly and oddly stacked MDCT and MDST matrices are actually the generalized inverses or pseudoinverses of their corresponding forward transform matrices.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A unified fast computation of the evenly and oddly stacked MDCT/MDST


    Contributors:


    Publication date :

    2003-01-01


    Size :

    266440 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English