Skip to main content

Module fft

Module fft 

Source
Expand description

Fast Fourier Transform (radix-2 Cooley–Tukey) and inverse FFT.

Inputs must have power-of-two length. For the extended transform suite (real-input FFT, 2D FFT, convolution, …), see mathverse-transforms.

Functions§

fft
Radix-2 Cooley–Tukey FFT of input.
ifft
Inverse FFT: ifft(fft(x)) ≈ x (up to floating-point roundoff).