Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding
From MaRDI portal
Publication:1027306
DOI10.1016/J.SIGPRO.2005.07.027zbMATH Open1163.94397OpenAlexW2083797656MaRDI QIDQ1027306FDOQ1027306
Authors: J. Blot 
Publication date: 1 July 2009
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2005.07.027
Recommendations
- A new fast algorithm for the unified forward and inverse MDCT/MDST computation
- An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa
- New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard
- A fast algorithm for the computation of 2-D forward and inverse MDCT
- A unified fast MDCT/MDST computation in the evenly stacked analysis/synthesis system
Cited In (9)
- New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
- Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
- A survey of efficient MDCT implementations in MP3 audio coding standard: Retrospective and state-of-the-art
- An efficient hardware accelerator architecture for implementing fast IMDCT computation
- A new fast algorithm for the unified forward and inverse MDCT/MDST computation
- Improved and extended mixed-radix decimation in frequency fast MDCT algorithm
- New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard
- A fast algorithm for the computation of 2-D forward and inverse MDCT
- A novel approach for fast computation of MDCT and IMDCT based on moments
This page was built for publication: Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027306)
