An introduction to programming the Winograd Fourier transform algorithm (WFTA)
From MaRDI portal
Publication:4166173
DOI10.1109/TASSP.1977.1162924zbMath0385.65062OpenAlexW2065387773MaRDI QIDQ4166173
Publication date: 1977
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/tassp.1977.1162924
Numerical methods for trigonometric approximation and interpolation (65T40) Algorithms in computer science (68W99)
Related Items (6)
A self-sorting in-place prime factor real/half-complex FFT algorithm ⋮ Hardware efficient fast computation of the discrete Fourier transform ⋮ Time optimization of segmentation methods for computing the bounds of correlation functions ⋮ Discrete orthogonal function expansions for non-uniform grids using the fast Fourier transform ⋮ A new technique for WFTA input/output reordering ⋮ A note on prime factor FFT algorithms
This page was built for publication: An introduction to programming the Winograd Fourier transform algorithm (WFTA)
