Fast IMDCT and MDCT algorithms - a matrix approach

DOI10.1109/TSP.2002.806566MaRDI QIDQ5353735zbMATH OpenOpenAlexFDO

Authors Mu-Huo Cheng, Yu-Hsin Hsu

Publication date 8 September 2017

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tsp.2002.806566

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(5)

• Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
• New recursive algorithms for the unified forward and inverse MDCT/MDST
• A unified fast MDCT/MDST computation in the evenly stacked analysis/synthesis system
• New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
• An efficient hardware accelerator architecture for implementing fast IMDCT computation

This page was built for publication: Fast IMDCT and MDCT algorithms - a matrix approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353735)