An introduction to programming the Winograd Fourier transform algorithm (WFTA)
From MaRDI portal
Publication:4166173
DOI10.1109/TASSP.1977.1162924zbMath0385.65062MaRDI 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
65T40: Numerical methods for trigonometric approximation and interpolation
68W99: Algorithms in computer science
Related Items
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 note on prime factor FFT algorithms, A self-sorting in-place prime factor real/half-complex FFT algorithm, Hardware efficient fast computation of the discrete Fourier transform, A new technique for WFTA input/output reordering