Return discrete inverse Fourier transform of real or complex sequence.
The returned complex array contains y(0), y(1),..., y(n-1) where
y(j) = (x * exp(2*pi*sqrt(-1)*j*np.arange(n)/n)).mean().
Parameters: | x : array_like
n : int, optional
axis : int, optional
overwrite_x : bool, optional
|
---|---|
Returns: | ifft : ndarray of floats
|
See also
Notes
This function is most efficient when n is a power of two, and least efficient when n is prime.
If the data type of x is real, a “real IFFT” algorithm is automatically used, which roughly halves the computation time.