5.2.1 FFT of a single sequence

The routines documented here compute the discrete Fourier transform (DFT) of a sequence of complex numbers in either single or double precision arithmetic. The DFT is computed using a highly-efficient FFT algorithm. There are two sets of interfaces available: simple drivers and expert drivers. The simple drivers perform in-place transforms on data held contiguously in memory using a fixed scaling factor; these are simpler to use and are sufficient for many problems. The expert drivers offer greater flexibility by including a number of additional arguments. These allow you to control: the scaling factor applied; whether the result should be output to a separate vector; and, the increments used in storing successive elements of both the input sequence and the result.

• ZFFT1D: One-dimensional Double Complex FFT, simple driver
• CFFT1D: One-dimensional, single precision, Complex FFT, simple driver
• ZFFT1DX: One-dimensional Double Complex FFT, expert driver
• CFFT1DX: One-dimensional, single precision, Complex FFT, expert driver