jax.numpy.fft.ifft2ΒΆ

jax.numpy.fft.ifft2(a, s=None, axes=(- 2, - 1), norm=None)[source]ΒΆ

Compute the 2-dimensional inverse discrete Fourier Transform.

LAX-backend implementation of ifft2().

Original docstring below.

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 ifft, should be ordered in the same way as is returned by 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.

Parameters
  • a (array_like) – Input array, can be complex.

  • s (sequence of ints, optional) – Shape (length of each 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 s is not given, the shape of the input along the axes specified by axes is used. See notes for issue on ifft zero padding.

  • axes (sequence of ints, optional) – Axes over which to compute the 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. A one-element sequence means that a one-dimensional FFT is performed.

  • norm ({None, "ortho"}, optional) –

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

complex ndarray