Module ordered

Ordered FFT module.

This FFT is currently based on the Stockham algorithm, and was ported from the OTFFT C++ library by Takuya OKAHISA.

This module computes the forward or inverse FFT in standard ordering. This means that given a buffer of complex numbers $[x_0, \dots, x_{n-1}]$, the forward FFT $[X_0, \dots, X_{n-1}]$ is given by $$X_p = \sum_{q = 0}^{n-1} \exp\left(-\frac{i 2\pi pq}{n}\right),$$ and the inverse FFT $[Y_0, \dots, Y_{n-1}]$ is given by $$Y_p = \sum_{q = 0}^{n-1} \exp\left(\frac{i 2\pi pq}{n}\right).$$

Structs

• Plan
  Ordered FFT plan.

Enums

• FftAlgo
  Internal FFT algorithm.
• Method
  Method for selecting the ordered FFT plan.