scipy.fftpack.ifft

scipy.fftpack.ifft(x, n=None, axis=-1, overwrite_x=0)

ifft(x, n=None, axis=-1, overwrite_x=0) -> y

Return inverse discrete Fourier transform of arbitrary type sequence x.

The returned complex array contains

[y(0),y(1),...,y(n-1)]

where

y(j) = 1/n sum[k=0..n-1] x[k] * exp(sqrt(-1)*j*k* 2*pi/n)

Optional input: see fft.__doc__