Fast IMDCT and MDCT algorithms - a matrix approach

Authors:
Mu-Huo Cheng;Yu-Hsin Hsu
Affiliations:
Dept. of Electr. & Control Eng., Nat. Chiao Tung Univ., Hsinchu, Taiwan;-
Venue:
IEEE Transactions on Signal Processing
Year:
2003

Citing 0
Cited 13

An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa

Signal Processing
Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding

Signal Processing
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations

Signal Processing
A fast algorithm for the computation of 2-D forward and inverse MDCT

Signal Processing
Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks

Signal Processing
A Configurable Common Filterbank Processor for Multi-Standard Audio Decoder

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks

Signal Processing
Mixed-radix algorithm for the computation of forward and inverse MDCTs

IEEE Transactions on Circuits and Systems Part I: Regular Papers
Spatial parameters for audio coding: MDCT domain analysis and synthesis

Multimedia Tools and Applications
An efficient hardware accelerator architecture for implementing fast IMDCT computation

Signal Processing
Autoregressive modeling of temporal/spectral envelopes with finite-length discrete trigonometric transforms

IEEE Transactions on Signal Processing
Review: A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art

Signal Processing
Generalized fast mixed-radix algorithm for the computation of forward and inverse MDCTs

Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

This paper presents a systematic investigation of the modified discrete cosine transform/inverse modified discrete cosine transform (MDCT/IMDCT) algorithm using a matrix representation. This approach results in new understanding of the MDCT/IMDCT, enables the development of new algorithms, and makes clear the connection between the algorithms. We represent in a matrix form the IMDCT as the product of the type-IV DCT with simple scaling, sign-changing, and permutation operations such that fast algorithms for the type-IV DCT can be simply modified for the IMDCT, and vice versa. Then, the simple symmetry and inversion properties of the type-IV DCT are used to develop new algorithms and establish the connection between existing fast IMDCT algorithms. This approach also enables us to show that MDCT and IMDCT share common core operation and present an efficient architecture for implementing both the MDCT and the IMDCT in one hardware.