The multiplicative complexity of discrete cosine transforms

DOI10.1016/0196-8858(92)90023-PzbMath0772.65096MaRDI QIDQ1802353

Elliot Linzer, Ephraim Feig

Publication date: 21 July 1993

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

discrete Fourier transformstensor productdirect sumdiscrete cosine transformsMultiplicative complexity

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Simple FFT and DCT algorithms with reduced number of operations.
• The multiplicative complexity of certain semilinear systems defined by polynomials
• The multiplicative complexity of the discrete Fourier transform
• On the multiplicative complexity of the discrete Fourier transform
• Computation of an odd-length DCT from a real-valued DFT of the same length
• On Computing the Discrete Fourier Transform

This page was built for publication: The multiplicative complexity of discrete cosine transforms