dpnp.fft.ifft2

dpnp.fft.ifft2(a, s=None, axes=(-2, -1), norm=None, out=None)[source]

Compute the 2-dimensional inverse discrete Fourier Transform.

This function computes the inverse of the 2-dimensional discrete Fourier Transform over any number of axes in an M-dimensional array by means of the Fast Fourier Transform (FFT). In other words, ifft2(fft2(a)) == a to within numerical accuracy. By default, the inverse transform is computed over the last two axes of the input array.

The input, analogously to dpnp.fft.ifft, should be ordered in the same way as is returned by dpnp.fft.fft2, i.e. it should have the term for zero frequency in the low-order corner of the two axes, the positive frequency terms in the first half of these axes, the term for the Nyquist frequency in the middle of the axes and the negative frequency terms in the second half of both axes, in order of decreasingly negative frequency.

For full documentation refer to numpy.fft.ifft2.

Parameters:

  • a ({dpnp.ndarray, usm_ndarray}) -- Input array, can be complex.

  • s ({None, sequence of ints}, optional) -- Shape (length of each transformed axis) of the output (s[0] refers to axis 0, s[1] to axis 1, etc.). This corresponds to n for ifft(x, n). Along each 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. If it is -1, the whole input is used (no padding/trimming). If s is not given, the shape of the input along the axes specified by axes is used. See notes for issue on dpnp.fft.ifft zero padding. If s is not None, axes must not be None either. Default: None.

  • axes ({None, sequence of ints}, optional) -- Axes over which to compute the inverse FFT. If not given, the last two axes are used. A repeated index in axes means the transform over that axis is performed multiple times. If s is specified, the corresponding axes to be transformed must be explicitly specified too. A one-element sequence means that a one-dimensional FFT is performed. An empty sequence means that no FFT is performed. Default: (-2, -1).

  • norm ({None, "backward", "ortho", "forward"}, optional) -- Normalization mode (see dpnp.fft). Indicates which direction of the forward/backward pair of transforms is scaled and with what normalization factor. None is an alias of the default option "backward". Default: "backward".

  • out ({None, dpnp.ndarray or usm_ndarray of complex dtype}, optional) -- If provided, the result will be placed in this array. It should be of the appropriate shape (consistent with the choice of s) and dtype. Default: None.

Returns:

out -- The truncated or zero-padded input, transformed along the axes indicated by axes, or the last two axes if axes is not given.

Return type:

dpnp.ndarray of complex dtype

See also

dpnp.fft

Overall view of discrete Fourier transforms, with definitions and conventions used.

dpnp.fft.fft2

The forward two-dimensional FFT, of which dpnp.fft.ifft2 is the inverse.

dpnp.fft.ifftn

The inverse of N-dimensional FFT.

dpnp.fft.fft

The one-dimensional FFT.

dpnp.fft.ifft

The one-dimensional inverse FFT.

Notes

dpnp.fft.ifft2 is just dpnp.fft.ifftn with a different default for axes. See dpnp.fft for details, definitions and conventions used.

Zero-padding, analogously with dpnp.fft.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 dpnp.fft.ifft2 is called.

Examples

>>> import dpnp as np
>>> a = 4 * np.eye(4)
>>> np.fft.ifft2(a)
array([[1.+0.j,  0.+0.j,  0.+0.j,  0.+0.j], # may vary
       [0.+0.j,  0.+0.j,  0.+0.j,  1.+0.j],
       [0.+0.j,  0.+0.j,  1.+0.j,  0.+0.j],
       [0.+0.j,  1.+0.j,  0.+0.j,  0.+0.j]])