Usage Notes

A fast Fourier transform (FFT) is simply a discrete Fourier transform that is computed efficiently. The straightforward method for computing the Fourier transform takes approximately n2 operations where n is the number of points in the transform, while the FFT (which computes the same values) takes approximately n log n operations. It uses the system’s high performance library for the computation, if available. The algorithms in this chapter are modeled on the Cooley-Tukey (1965) algorithm. Hence, these functions are most efficient for integers that are highly composite; that is, integers that are a product of small primes.

For the two functions imsl_f_fft_real and imsl_c_fft_complex there is a corresponding initialization function. Use these functions only when repeatedly transforming sequences of the same length. In this situation, the initialization function computes the initial setup once. Subsequently, the user calls the corresponding main function with the appropriate option. This may result in substantial computational savings. For more information on the use of these functions, consult the documentation under the appropriate function name.

In addition to the one-dimensional transformations described above, we also provide a complex two-dimensional FFT and its inverse.

There is, of course, a close connection between the discrete Fourier transform and the continuous Fourier transform. Recall that the continuous Fourier transform is defined (Brigham 1974) as

We begin by making the following approximation:

If we approximate the last integral using the rectangle rule with spacing h = T /n, we have

Finally, setting ω = j/T for j = 0, …, n − 1 yields

where the vector f h = (f(−T/2), …, f( (n − 1)h − T/2)). Thus, after scaling the components by (−1)jh, the discrete Fourier transform, as computed in imsl_c_fft_complex (with input f h) is related to an approximation of the continuous Fourier transform by the above formula.