Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations

DOI10.1016/0196-8858(89)90012-2zbMath0681.65107OpenAlexW1993256469MaRDI QIDQ1823640

Robert W. Johnson, Chao Lu, Richard Tolimieri

Publication date: 1989

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(89)90012-2

zbMATH Keywords

fast Fourier transformparallel computingWinograd's algorithmFFT-algorithms

Mathematics Subject Classification ID

Trigonometric interpolation (42A15) Parallel numerical computation (65Y05) Numerical methods for trigonometric approximation and interpolation (65T40)

Cites Work

• On computing the Discrete Fourier Transform
• On Computing the Discrete Fourier Transform
• Unnamed Item
• Unnamed Item

This page was built for publication: Modified Winograd FFT algorithm and its variants for transform size \(N=p^ k\) and their implementations