Module fourier 

Discrete Fourier transform and its inverse over complex samples.

Functions

dft

Forward DFT: X[k] = Σ_n x[n] · e^{−2πi kn/N}.

dft_accelerated

Best-path forward DFT for spectral callers that accept f32 precision: X[k] = Σ_n x[n] · e^{−2πi kn/N}, same un-normalized forward convention as dft, but accelerated on the GPU when possible.

idft

Inverse DFT: x[n] = (1/N) Σ_k X[k] · e^{+2πi kn/N}.

Type Aliases

Cplx

A complex number as (real, imaginary).