Bilinear algorithms for discrete cosine transforms of prime lengths

DOI10.1016/J.SIGPRO.2005.10.022zbMATH Open1172.94342OpenAlexW2020114631MaRDI QIDQ1031295FDOQ1031295

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

Recommendations

• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• On the realization of discrete cosine transform using the distributed arithmetic
• Fast radix-\(p\) discrete cosine transform
• Computation of an odd-length DCT from a real-valued DFT of the same length
• Fast algorithms for the discrete cosine transform

zbMATH Keywords

fast algorithmbilineargroup theorycyclic convolutiondiscrete cosine transform

Mathematics Subject Classification ID

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

Cited In (6)

• A new fast algorithm for computing prime-Length DCT through cyclic convolutions.
• New universal rotation-based fast computational structures for an efficient implementation of the DCT-IV/DST-IV and analysis/synthesis MDCT/MDST filter banks
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• Input and output index mappings for a prime-factor-decomposed computation of discrete cosine transform
• New fast computational structures for an efficient implementation of the forward/backward MDCT in MP3 audio coding standard
• On the multiplicative complexity of discrete cosine transforms

This page was built for publication: Bilinear algorithms for discrete cosine transforms of prime lengths

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