Important: The FFT and iFFT functions have been deprecated.  Use the superseding functions FourierTransform and InverseFourierTransform in the DiscreteTransforms package instead. These new functions can compute the fast Fourier transform for sequences of arbitrary length (not restricted to a power of 2).

The FFT(m,x,y) and iFFT(m,x,y) commands compute in place the fast Fourier transform and the inverse fast Fourier transform of a complex sequence of length .

The first argument m should be a non-negative integer and the second and third arguments x and y should be arrays of floats indexed from 1 to  .  The array x contains the real part of the complex sequence on input and contains the real part of the fast Fourier transform on output.  The array y contains the imaginary part of the complex sequence on input and contains the imaginary part of the fast Fourier transform on output. Both procedures return 2^m, the number of points in the complex sequence.

These procedures may be invoked with evalhf, which uses the hardware floating-point number system.

Oppenheim, Allan, V., and Schafer, Ronald W. Digital Signal Processing. New Jersey: Prentice-Hall, 1975.  See Fig. 6.5, p. 332.