Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)

DOI10.1049/EL:19880380zbMath0684.65119OpenAlexW2060066381MaRDI QIDQ4734736

Dekun Yang, Weizhen Ma

Publication date: 1988

Published in: Electronics Letters (Search for Journal in Brave)

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

zbMATH Keywords

discrete Fourier transformdiscrete cosine transformmultiplicative complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40)

This page was built for publication: Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)