New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
DOI10.1016/J.SIGPRO.2009.04.041zbMATH Open1169.94305OpenAlexW2038638465MaRDI QIDQ839079FDOQ839079
Authors: Vladimir Britanak 
Publication date: 1 September 2009
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2009.04.041
Recommendations
- The fast DCT-IV/DST-IV computation via the MDCT
- Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
- New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard
- A new fast algorithm for the unified forward and inverse MDCT/MDST computation
- Linear filtering in DCT IV/DST IV and MDCT/MDST domain
modified discrete cosine transformmodulated lapped transformanalysis and synthesis MDCT filter banksfast computational structureinteger MDCTlossless audio codingmodified discrete sine transformmodulated complex lapped transformMPEG audio coding
Filtering in stochastic control theory (93E11) Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)
Cites Work
- New recursive algorithms for the unified forward and inverse MDCT/MDST
- A fast algorithm for the computation of 2-D forward and inverse MDCT
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast and numerically stable algorithms for discrete cosine transforms
- Title not available (Why is that?)
- The fast DCT-IV/DST-IV computation via the MDCT
- Type-IV DCT, DST, and MDCT algorithms with reduced numbers of arithmetic operations
- Title not available (Why is that?)
- On the necessity and sufficiency of \(PLUS\) factorizations
- Customizable triangular factorizations of matrices
- Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding
- Bilinear algorithms for discrete cosine transforms of prime lengths
- Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
- Invertible integer DCT algorithms
- A global method for invertible integer DCT and integer wavelet algorithms
- A new fast algorithm for the unified forward and inverse MDCT/MDST computation
- Integer MDCT with enhanced approximation of the DCT-IV
- Modulo transforms - an alternative to lifting
- 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
- Low noise reversible MDCT (RMDCT) and its application in progressive-to-lossless embedded audio coding
- Worst-case error analysis of lifting-based fast DCT-algorithms
- An efficient computing of oddly stacked MDCT/MDST via evenly stacked MDCT/MDST and vice versa
Cited In (5)
- Signal flow graph approach to efficient and forward stable DST algorithms
- Fast computational structures for an efficient implementation of the complete TDAC analysis/synthesis MDCT/MDST filter banks
- The fast DCT-IV/DST-IV computation via the MDCT
- Linear filtering in DCT IV/DST IV and MDCT/MDST domain
- New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard
Uses Software
This page was built for publication: New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839079)
