Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
