Bilinear algorithms for discrete cosine transforms of prime lengths

DOI10.1016/j.sigpro.2005.10.022zbMath1172.94342OpenAlexW2020114631MaRDI QIDQ1031295

Venkatram Muddhasani, Meghanad D. Wagh

Publication date: 29 October 2009

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

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

zbMATH Keywords

fast algorithmgroup theorydiscrete cosine transformcyclic convolutionbilinear

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Application of orthogonal and other special functions (94A11)

Related Items

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