Inverse Fast discrete Fourier Transform.

Namespace: dsp::fourier

Prototype

auto ifft(const Vector<T> &X)

Description

This function will compute the normalized DFT inverse of a real or complex vector: \[ X_n = \frac{1}{\sqrt{N}}\cdot\sum_{k=0}^{N-1} x_k \cdot e^{\frac{+2\pi\mathbf{i}kn}{N}} \]

Example

let x1 = randcn(100),
    X  = fft(x1),
    x2 = ifft(X);

assert((x2-x1).norm2() < 1e-7);

See also

fft(), rfft()