Multiplicative complexity of length-2mtwo-dimensional discrete cosine transform

DOI10.1049/EL:19910603MaRDI QIDQ3985183zbMATH OpenOpenAlexFDO

Authors

Publication date 27 June 1992

Published in Electronics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1049/el:19910603

zbMATH Keywords

Chebyshev transformdiscrete cosine transformmultiplicative complexitypolynomial transform

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Complexity and performance of numerical algorithms (65Y20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• The multiplicative complexity of discrete cosine transforms
• On the multiplicative complexity of discrete cosine transforms
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)
• Multiplicative complexity of discrete cosine and sine transform
• The multiplicative complexity of the discrete Fourier transform
• scientific article; zbMATH DE number 193953
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
• Bilinear algorithms for discrete cosine transforms of prime lengths
• Discrete Fourier Transform, Joint Linear Complexity and Generalized Joint Linear Complexity of Multisequences
• On the additive complexity of 2 \(\times 2\) matrix multiplication

Cited in

(5)

• The multiplicative complexity of discrete cosine transforms
• Algorithms meeting the lower bounds on the multiplicative complexity of length-2/sup n/ DFTs and their connection with practical algorithms
• Multiplicative complexity of discrete cosine and sine transform
• On the multiplicative complexity of discrete cosine transforms
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)

This page was built for publication: Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform

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