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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

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


    Beteiligte:
    Britanak, V. (Autor:in)


    Erscheinungsdatum :

    2003-01-01


    Format / Umfang :

    266440 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch