  |
Jörgs Useful and Ugly FFT page - http://www.jjj.de/fft/fftpage.html
Code and links in Fortran and C for the Fast Fourier Transform. |
| |
Pipelined phase-rotation FFT - http://www.cs.cmu.edu/afs/cs.cmu.edu/project/iwarp/member/fx/public/www/phase1.html
By David O'Halloran. The Welchel phase-rotation FFT is a new form of the fast Fourier transform (FFT) that replaces data movement at runtime with equivalent multiplications by precomputed constants. The result is an FFT that is easy to pipeline. |
| |
CHIRP-Z transform for FFTs - http://users.bigpond.net.au/amiller/apstat/chirp.f90
Little known algorithm for calculating the FFT of a series of any length. Based upon Applied Statistics algorithms 117 and 83. |
| |
Ernst Mayer - http://hogranch.com/mayer/resume.html
Fortran 90 codes for Fast Fourier Transforms and Discrete Weighted Transforms, for use in number theory research. |
| |
A Short Demonstration Version of the FFT - http://members.tripod.com/michaelgellis/dsp/pgm05.html
Source code of a subroutine to transform (forward or inverse) a one-dimensional complex array in place. |