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

DOI10.1016/j.sigpro.2009.01.014zbMath1178.94038OpenAlexW2127137713MaRDI QIDQ1032381

Vladimir Britanak, Huibert J. Lincklaen Arriëns

Publication date: 26 October 2009

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2009.01.014

zbMATH Keywords

modified discrete cosine transformmodulated lapped transformfast computational structuremodified discrete sine transformmodulated complex lapped transformMPEG audio coding

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items (2)

New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks ⋮ New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard

Uses Software

• MDCT/MDST
• MDCT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The fast DCT-IV/DST-IV computation via the MDCT
• An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa
• Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
• A fast algorithm for the computation of 2-D forward and inverse MDCT
• Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding
• The discrete W transform
• New recursive algorithms for the unified forward and inverse MDCT/MDST
• A new fast algorithm for the unified forward and inverse MDCT/MDST computation
• Fast and numerically stable algorithms for discrete cosine transforms
• A Novel DCT-Based Algorithm for Computing the Modulated Complex Lapped Transform
• Fast IMDCT and MDCT algorithms - a matrix approach
• Computation of forward and inverse MDCT using clenshaw's recurrence formula

This page was built for publication: Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks