New fast algorithm for two-dimensional discrete Fourier transform DFT(2n; 2)

DOI10.1049/el:19890015zbMath0689.65087OpenAlexW2026244262MaRDI QIDQ3031888

Dekun Yang, Weizhen Ma

Publication date: 1989

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

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

zbMATH Keywords

algorithmpermutationfast discrete Fourier transformplacefast discrete cosine transform

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for trigonometric approximation and interpolation (65T40) Fourier coefficients, Fourier series of functions with special properties, special Fourier series (42A16)

Related Items (1)

Numerical inversion of 2-D Laplace transforms by fast Hartley transform computations

This page was built for publication: New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)