FORTRAN PROGRAM FOR FAST FOURIER TRANSFORM,
Abstract
The recent development of algorithms for the rapid computation of Fourier transforms has reduced the computation time of this powerful analysis tool by orders of magnitude, enabling previously uneconomic procedures to become commonplace. In the report the fast Fourier transform (FFT) is derived from the basic equations and presented in matrix form as a means of illustrating the stage-by-stage reduction of the input data to Fourier coefficients by the algorithm. Based on this development a Fortran IV program is presented, including a full description of the statements, by relating it to the theoretical requirements. Thus a complete understanding of the FFT algorithm and program can be obtained, eliminating the constraints imposed by treating the FFT as a black box beyond the manipulative powers of the user. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 16, 1970
- Accession Number
- AD0706003
Entities
People
- James R. Fisher
Organizations
- United States Naval Research Laboratory