Fourier Transforms
This is my Fourier Transforms Collection. Though I was able to get
a discrete transform program working, I never felt comfortable with
my fast fourier transform code. Fourier.f was the original program
that i came up with, just a straight calculation of the coefficients.
Second, I made DFT.f, which utilized the function aspect of fortran
and used a subroutine to call this function with the relevant data.
In the second program, DFT1.f, I added in the option to key in the
starting values as opposed to hardcoded values. This gave the
possibility of calculating any functions DFT as opposed to just the
one set of values used originally. In DFT2.f, I made my first attempt
at adding in a FFT algorithm as an option also. The type of calculation
made was still up to the user, as they could choose either DFT or FFT.
The algorithm never really got up an running. I then made FFT1.f,
which was going to be simply an FFT calculator. This used the bit
reversal method to speed up the calculations. It is however messy and
I got lost in the debugging and i never really got it going.
Jesse Welch
Last modified: Fri Dec 15 14:09:22 EST 2006