Low complexity and fast computation for recursive MDCT and IMDCT algorithms

Authors:
Sheau-Fang Lei;Shin-Chi Lai;Po-Yin Cheng;Ching-Hsing Luo
Affiliations:
Electrical Engineering Department, National Cheng Kung University, Tainan, Taiwan;Electrical Engineering Department, National Cheng Kung University, Tainan, Taiwan;Electrical Engineering Department, National Cheng Kung University, Tainan, Taiwan;Electrical Engineering Department and the Institute of Nanotechnology and Microsystems Engineering, National Cheng Kung University, Tainan, Taiwan
Venue:
IEEE Transactions on Circuits and Systems II: Express Briefs
Year:
2010

Citing 4
Cited 2

Signal Processing with Lapped Transforms

Signal Processing with Lapped Transforms
New Recursive Algorithms for the Unified Forward and Inverse MDCT/MDST

Journal of VLSI Signal Processing Systems
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
Computation of forward and inverse MDCT using Clenshaw's recurrence formula

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	0.00

Visualization

Abstract

Fast algorithms are derived for modified discrete cosine transform (MDCT) and inverse MDCT (IMDCT) in this brief. The proposed algorithms based on type II discrete cosine transform and type II discrete sine transform not only adopt a unified architecture for both MDCT and IMDCT computations but also take only N/8 + 1 computational cycles for each output sequence. Compared with previous IMDCT approaches, the number of preprocessing multiplications of the proposed IMDCT algorithm is reduced by 87.5%. In addition, the coefficient requirements for preprocessing in the proposed IMDCT algorithm can be reduced by 50%, and the number of multiplications for the recursive kernel is greatly decreased by up to 87.5%. The proposed algorithms in terms of hardware costs take two fewer multipliers and six fewer adders than some well-known recursive algorithms. Therefore, the proposed architecture is better suited for various audio codecs.