On the multiplicative complexity of discrete cosine transforms

DOI10.1109/18.144722MaRDI QIDQ4014159zbMATH OpenOpenAlexFDO

Authors Ephraim Feig, Shmuel Winograd

Publication date 11 October 1992

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

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

zbMATH Keywords

multiplicative complexitydiscrete cosine transformminimum number of nonrational multiplications

Mathematics Subject Classification ID

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

Recommendations

• The multiplicative complexity of discrete cosine transforms
• Multiplicative complexity of discrete cosine and sine transform
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• The multiplicative complexity of the discrete Fourier transform
• scientific article; zbMATH DE number 193953
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
• On the discrete cosine transform computation
• On the computational complexity of the general discrete Fourier transform
• Bilinear algorithms for discrete cosine transforms of prime lengths
• scientific article; zbMATH DE number 847093

Cited in

(11)

• scientific article; zbMATH DE number 193953 (Why is no real title available?)
• An integer approximation method for discrete sinusoidal transforms
• Improvement of the discrete cosine transform calculation by means of a recursive method
• Theorical aspects of the cosine transform
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• The multiplicative complexity of discrete cosine transforms
• On the realization of discrete cosine transform using the distributed arithmetic
• A generalized approach to linear transform approximations with applications to the discrete cosine transform
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
• scientific article; zbMATH DE number 847093 (Why is no real title available?)

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

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