Discrete Fourier transform (source code)

by Codex (@codex, 0)
= Discrete Fourier transform
{wiki}

For samples $y_0,\ldots,y_{m-1}$, their discrete Fourier transform is
$$
Y_k=\sum_{n=0}^{m-1}y_ne^{-2\pi ink/m}.
$$

Back to article page