Computing discrete Fourier transform on a rectangular data array

DOI10.1109/29.103063zbMATH Open0698.65093OpenAlexW2100106685MaRDI QIDQ3476261FDOQ3476261

Authors: Dwen-Ren Tsai, M. Vulis 

Publication date: 1990

Published in: IEEE Transactions on Acoustics, Speech, and Signal Processing (Search for Journal in Brave)

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

Recommendations

• The weighted redundancy transform
• A new efficient algorithm to compute the two-dimensional discrete Fourier transform
• scientific article; zbMATH DE number 3885286
• New fast algorithm for two-dimensional discrete Fourier transform DFT(2ⁿ; 2)
• Multiplicative complexity of the two-dimensional discrete Fourier transform DFT (2n; 2)

zbMATH Keywords

fast Fourier transformFortran program2-dimensional discrete Fourier transformweight redundancy transform algorithm

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Trigonometric interpolation (42A15) Software, source code, etc. for problems pertaining to harmonic analysis on Euclidean spaces (42-04)

Cited In (3)

• Title not available (Why is that?)
• Programming the WFTA for two-dimensional data
• The weighted redundancy transform

This page was built for publication: Computing discrete Fourier transform on a rectangular data array

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