5.2.2 FFT of multiple complex sequences

The routines documented here compute the discrete Fourier transforms (DFTs) of a number of sequences of complex numbers in either single or double precision arithmetic. The sequences must all have the same length. The DFTs are 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; the increments used in storing successive elements of a given sequence (for both input and output sequences); and the increments used in storing corresponding elements in successive sequences (for both input and output).

• ZFFT1M: Multiple one-dimensional Double Complex FFTs, simple driver
• CFFT1M: Multiple one-dimensional, single precision, Complex FFTs, simple driver
• ZFFT1MX: Multiple one-dimensional Double Complex FFTs, expert driver
• CFFT1MX: Multiple one-dimensional, single precision, Complex FFTs, expert driver