An introduction to programming the Winograd Fourier transform algorithm (WFTA)

DOI10.1109/TASSP.1977.1162924zbMATH Open0385.65062OpenAlexW2065387773MaRDI QIDQ4166173FDOQ4166173

Authors: Harvey F. Silverman 

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

Mathematics Subject Classification ID

Numerical methods for trigonometric approximation and interpolation (65T40) Algorithms in computer science (68W99)

Cited In (6)

• A self-sorting in-place prime factor real/half-complex FFT algorithm
• 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
• Hardware efficient fast computation of the discrete Fourier transform
• Time optimization of segmentation methods for computing the bounds of correlation functions

This page was built for publication: An introduction to programming the Winograd Fourier transform algorithm (WFTA)

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