Programming the WFTA for two-dimensional data

DOI10.1109/29.31296MaRDI QIDQ3033290zbMATH OpenOpenAlexFDO

Authors Harvey F. Silverman

Publication date 1989

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.31296

zbMATH Keywords

discrete Fourier transformfast Fourier transformimplementationsignal processingWinograd Fourier transform algorithm

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Numerical methods for trigonometric approximation and interpolation (65T40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Recommendations

• The design of optimal DFT algorithms using dynamic programming
• Computing discrete Fourier transform on a rectangular data array
• scientific article; zbMATH DE number 3938512
• Two and three dimensional FFTs on highly parallel computers
• On computing the 2-D FFT

Cited in

(3)

• Two-dimensional digital signal processing II. Transforms and median filters
• Theory and algorithms for two-dimensional warped discrete Fourier transform
• Didactic software for teaching image processing using fast Fourier transformation

This page was built for publication: Programming the WFTA for two-dimensional data

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