fourier

func DFT ¶

func DFT(in, out []complex128)

DFT computes the discrete fourier transform of the given input. It's computation time is O(n^2) and thus should only be used for small inputs.

Note: the input & output arrays must be of the same size.

Formula: Xₖ = ∑ⁿ⁻¹ⱼ₌₀ inᵢ·e^(-2iπ·jk/n)

func FFT ¶

func FFT(in, out []complex128)