Computation of forward and inverse MDCT using Clenshaw's recurrence formula

Authors:
V. Nikolajevic;G. Fettweis
Affiliations:
Adv. Technol. Center, Sony Int. (Eur.) GmbH, Stuttgart, Germany;-
Venue:
IEEE Transactions on Signal Processing
Year:
2003

Citing 0
Cited 12

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

Signal Processing
Recursive computation of Tchebichef moment and its inverse transform

Pattern Recognition
Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations

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
Efficient architectures of MDCT/IMDCT implementation for MPEG audio codec

ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Common architecture design of novel recursive MDCT and IMDCT algorithms for application to AAC, AAC in DRM, and MP3 codecs

IEEE Transactions on Circuits and Systems II: Express Briefs
An efficient hardware accelerator architecture for implementing fast IMDCT computation

Signal Processing
Low complexity and fast computation for recursive MDCT and IMDCT algorithms

IEEE Transactions on Circuits and Systems II: Express Briefs
Review: A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art

Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

The forward and inverse modified discrete cosine transform (MDCT) are two of the most computationally intensive operations in the MPEG audio coding standard. In this paper, we used Clenshaw's recurrence formula to transform kernels of the MDCT and IMDCT of the general length. Efficient implementations of MDCT and IMDCT are obtained. The proposed regular structures are particularly suitable for parallel VLSI realization. Our solution requires less hardware, and we achieved significant savings for a number of operations compared with existing related systems.