bundles / scipy latest / scipy / fft / _basic / ifftn
_Function
scipy.fft._basic:ifftn
source: /scipy/fft/_basic.py :733
Signature
def ifftn ( x , s = None , axes = None , norm = None , overwrite_x = False , workers = None , * , plan = None ) Summary
Compute the N-D inverse discrete Fourier Transform.
Extended Summary
This function computes the inverse of the N-D discrete Fourier Transform over any number of axes in an M-D array by means of the Fast Fourier Transform (FFT). In other words, ifftn(fftn(x)) == x to within numerical accuracy.
The input, analogously to ifft, should be ordered in the same way as is returned by fftn, i.e., it should have the term for zero frequency in all axes in the low-order corner, the positive frequency terms in the first half of all axes, the term for the Nyquist frequency in the middle of all axes and the negative frequency terms in the second half of all axes, in order of decreasingly negative frequency.
Parameters
x: array_likeInput array, can be complex.
s: sequence of ints, optionalShape (length of each transformed axis) of the output (
s[0]refers to axis 0,s[1]to axis 1, etc.). This corresponds tonforifft(x, n). Along any axis, if the given shape is smaller than that of the input, the input is cropped. If it is larger, the input is padded with zeros. ifsis not given, the shape of the input along the axes specified byaxesis used. See notes for issue onifftzero padding.axes: sequence of ints, optionalAxes over which to compute the IFFT. If not given, the last
len(s)axes are used, or all axes ifsis also not specified.norm: {"backward", "ortho", "forward"}, optionalNormalization mode (see fft). Default is "backward".
overwrite_x: bool, optionalIf True, the contents of
xcan be destroyed; the default is False. See fft for more details.workers: int, optionalMaximum number of workers to use for parallel computation. If negative, the value wraps around from
os.cpu_count(). See fft for more details.plan: object, optionalThis argument is reserved for passing in a precomputed plan provided by downstream FFT vendors. It is currently not used in SciPy.
Returns
out: complex ndarrayThe truncated or zero-padded input, transformed along the axes indicated by
axes, or by a combination ofsorx, as explained in the parameters section above.
Raises
: ValueErrorIf
sandaxeshave different length.: IndexErrorIf an element of
axesis larger than the number of axes ofx.
Notes
Zero-padding, analogously with ifft, is performed by appending zeros to the input along the specified dimension. Although this is the common approach, it might lead to surprising results. If another form of zero padding is desired, it must be performed before ifftn is called.
Array API Standard Support
ifftn has experimental support for Python Array API Standard compatible backends in addition to NumPy. Please consider testing these features by setting an environment variable SCIPY_ARRAY_API=1 and providing CuPy, PyTorch, JAX, or Dask arrays as array arguments. The following combinations of backend and device (or other capability) are supported.
==================== ==================== ==================== Library CPU GPU ==================== ==================== ==================== NumPy ✅ n/a CuPy n/a ✅ PyTorch ✅ ✅ JAX ✅ ✅ Dask ⚠️ computes graph n/a ==================== ==================== ====================
See
dev-arrayapifor more information.
Examples
import scipy.fft import numpy as np x = np.eye(4)✓
scipy.fft.ifftn(scipy.fft.fftn(x, axes=(0,)), axes=(1,))
✗import matplotlib.pyplot as plt rng = np.random.default_rng() n = np.zeros((200,200), dtype=complex) n[60:80, 20:40] = np.exp(1j*rng.uniform(0, 2*np.pi, (20, 20))) im = scipy.fft.ifftn(n).real plt.imshow(im) plt.show()✓

See also
- fftn
The forward N-D FFT, of which
ifftnis the inverse.- ifft
The 1-D inverse FFT.
- ifft2
The 2-D inverse FFT.
- ifftshift
Undoes
fftshift, shifts zero-frequency terms to beginning of array.
Aliases
-
scipy.fft.ifftn