The
FFT
function returns a result equal to the complex, discrete Fourier transform of *
Array*
. The result of this function is a single- or double-precision complex array.

The discrete Fourier transform, *
F*
(*
u*
), of an *
N*
-element, one-dimensional function, *
f*
(*
x*
), is defined as:

And the inverse transform, (*
Direction*
> 0), is defined as:

If the keyword OVERWRITE is set, the transform is performed in-place, and the result overwrites the original contents of the array.

The result returned by FFT is a complex array that has the same dimensions as the input array. The output array is ordered in the same manner as almost all discrete Fourier transforms. Element 0 contains the zero frequency component, F0. F1 contains the smallest nonzero positive frequency, which is equal to 1/(Ni Ti), where Ni and Ti are the number of elements and the sampling interval of the ith dimension, respectively. F2 corresponds to a frequency of 2/(Ni Ti). Negative frequencies are stored in the reverse order of positive frequencies, ranging from the highest to lowest negative frequencies (see storage scheme below).

**NOTE: **
The FFT can be performed on functions of up to eight (8) dimensions in size. If a function has n dimensions, IDL performs a transform in each dimension separately, starting with the first dimension and progressing sequentially to dimension n. For example, if the function has two dimensions, IDL first does the FFT row by row, and then column by column.

For an even number of points in the ith dimension, the storage scheme of returned complex values is as follows:

For an odd number of points in the ith dimension, the storage scheme of returned complex values is as follows:

The array to which the Fast Fourier Transform should be applied. If *
Array*
is not of complex type, it is converted to complex type. The dimensions of the result are identical to those of *
Array*
. The size of each dimension may be any integer value and does not necessarily have to be an integer power of 2, although powers of 2 are certainly the most efficient.

*
Direction*
is a scalar indicating the direction of the transform, which is negative by convention for the forward transform, and positive for the inverse transform. If *
Direction*
is not specified, the forward transform is performed.

A normalization factor of 1/*
N*
, where *
N*
is the number of points, is applied during the forward transform.

**NOTE: **
When transforming from a real vector to complex and back, it is slightly faster to set *
Direction*
to 1 in the real to complex FFT.

Note also that the value of *
Direction*
is ignored if the INVERSE keyword is set.

Set this keyword to a value other than zero to force the computation to be done in double-precision arithmetic, and to give a result of double-precision complex type. If DOUBLE is set equal to zero, computation is done in single-precision arithmetic and the result is single-precision complex. If DOUBLE is not specified, the data type of the result will match the data type of *
Array*
.

For a one-dimensional FFT, running time is roughly proportional to the total number of points in *
Array*
times the sum of its prime factors. Let *
N*
be the total number of elements in *
Array*
, and decompose *
N*
into its prime factors:

Running time is proportional to:

where *
T*
_{
3}
~ *
4T*
_{
2}
. For example, the running time of a 263 point FFT is approximately 10 times longer than that of a 264 point FFT, even though there are fewer points. The sum of the prime factors of 263 is 264 (1 + 263), while the sum of the prime factors of 264 is 20 (2 + 2 + 2 + 3 + 11).

Display the log of the power spectrum of a 100-element index array by entering:

PLOT, /YLOG, ABS(FFT(FINDGEN(100), -1))

As a more complex example, display the power spectrum of a 100-element vector sampled at a rate of 0.1 seconds per point. Show the 0 frequency component at the center of the plot and label the abscissa with frequency:

N = 100 *;
Define the number of points.*

T = 0.1 *;
Define the interval.*

N21 = N/2 + 1 *;
Midpoint+1 is the most negative frequency subscript.*

F = INDGEN(N) *;
The array of subscripts.*

F[N21] = N21 -N + FINDGEN(N21-2) *;
Insert negative frequencies in elements F(N/2 +1), ..., F(N-1).*

F = F/(N*T) *;
Compute T*
_{
0}
*;
frequency.*

PLOT, /YLOG, SHIFT(F, -N21), SHIFT(ABS(FFT(F, -1)), -N21)

*;
Shift so that the most negative frequency is plotted first.*