Home |
Fast Fourier Transforms (6) See Also:
Sites:
» A Short Demonstration Version of the FFT
Source code of a subroutine to transform (forward or inverse) a one-dimensional complex array in place. http://members.tripod.com/michaelgellis/dsp/pgm05.html » Ernst Mayer
Fortran 90 codes for Fast Fourier Transforms and Discrete Weighted Transforms, for use in number theory research. http://hogranch.com/mayer/resume.html » Jörgs Useful and Ugly FFT page
Code and links in Fortran and C for the Fast Fourier Transform. http://www.jjj.de/fft/fftpage.html » Pipelined phase-rotation FFT
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. http://www.cs.cmu.edu/afs/cs.cmu.edu/project/iwarp/member/fx/public/www/phase1.html » Romo's Free Software
OFFT, "Outrageously Fast Fortran Transpose", and BFFFT, "Blazingly Fast FFT, 2-Dimensional Vectorized Fast Fourier Transform" written in Fortran 90. http://romo661.free.fr/ This category needs an editor
Last Updated: 2007-01-02 19:57:54
The content of this directory is based on the Open Directory and has been modified by GoSearchFor.com |