Multiplicative complexity of discrete cosine and sine transform

DOI10.1049/EL:19910600MaRDI QIDQ3985181zbMATH 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:19910600

zbMATH Keywords

discrete cosine and sine transformsmultiplicative complexitysignal processing

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

• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• On the multiplicative complexity of discrete cosine transforms
• The multiplicative complexity of discrete cosine transforms

Cited in

(5)

• The multiplicative complexity of discrete cosine transforms
• Multiplicative complexity of length-2^mtwo-dimensional discrete cosine transform
• On the multiplicative complexity of discrete cosine transforms
• scientific article; zbMATH DE number 193953 (Why is no real title available?)
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)

This page was built for publication: Multiplicative complexity of discrete cosine and sine transform

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