Fast Radix 2, 3, 4, and 5 Kernels for Fast Fourier Transformations on Computers with Overlapping Multiply--Add Instructions
Author:
- S. GoedeckerSGS. Goedecker
- 1 November 1997
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 18 (6) , 1605-1611
Abstract
We present a new formulation of fast Fourier transformation (FFT) kernels for radix 2, 3, 4, and 5, which have a perfect balance of multiplies and adds. These kernels give higher performance on machines that have a single multiply--add (mult--add) instruction. We demonstrate the superiority of this new kernel on IBM and SGI workstations.Keywords
This publication has 3 references indexed in Scilit:
- Computational Frameworks for the Fast Fourier Transform1992
- Self-sorting mixed-radix fast Fourier transformsJournal of Computational Physics, 1983
- An algorithm for computing the mixed radix fast Fourier transformIEEE Transactions on Audio and Electroacoustics, 1969