flopscope.numpy.fft.ifftn
fnp.fft.ifftn(a, s=None, axes=None, norm=None, out=None)[flopscope source][numpy source]
Compute the N-dimensional inverse discrete Fourier Transform.
Adapted from NumPy docs np.fft.ifftn
Inverse N-D complex FFT. Cost: 5*N*ceil(log2(N)), N=prod(s) (Cooley-Tukey radix-2; Van Loan 1992 §1.4).
This function computes the inverse of the N-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,
ifftn(fftn(a)) == a to within numerical accuracy.
For a description of the definitions and conventions used, see flops.fft.
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
- a:array_like
Input array, can be complex.
- s: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 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.Changed in version 2.0.If
sis not given, the shape of the input along the axes specified byaxesis used. See notes for issue onifftzero padding.Deprecated since 2.0.Deprecated since 2.0.- axes:sequence of ints, optional
Axes over which to compute the IFFT. If not given, the last
len(s)axes are used, or all axes ifsis also not specified. Repeated indices inaxesmeans that the inverse transform over that axis is performed multiple times.Deprecated since 2.0.- norm:{"backward", "ortho", "forward"}, optional
Normalization mode (see flops.fft). Default is "backward". Indicates which direction of the forward/backward pair of transforms is scaled and with what normalization factor.
Added in version 1.20.0.- out:complex ndarray, optional
If provided, the result will be placed in this array. It should be of the appropriate shape and dtype for all axes (and hence is incompatible with passing in all but the trivial
s).Added in version 2.0.0.
Returns
- out:complex ndarray
The truncated or zero-padded input, transformed along the axes indicated by
axes, or by a combination ofsora, as explained in the parameters section above.
Raises
- :ValueError
If
sandaxeshave different length.- :IndexError
If an element of
axesis larger than than the number of axes ofa.
See also
- flops.fft Overall view of discrete Fourier transforms, with definitions and conventions used.
- fftn The forward n-dimensional FFT, of which
ifftnis the inverse. - ifft The one-dimensional inverse FFT.
- ifft2 The two-dimensional inverse FFT.
- ifftshift Undoes
fftshift, shifts zero-frequency terms to beginning of array.
Notes
See flops.fft for definitions and conventions used.
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.
Examples
>>> import flopscope.numpy as fnp
>>> a = flops.eye(4)
>>> flops.fft.ifftn(flops.fft.fftn(a, axes=(0,)), axes=(1,))
array([[1.+0.j, 0.+0.j, 0.+0.j, 0.+0.j], # may vary
[0.+0.j, 1.+0.j, 0.+0.j, 0.+0.j],
[0.+0.j, 0.+0.j, 1.+0.j, 0.+0.j],
[0.+0.j, 0.+0.j, 0.+0.j, 1.+0.j]])Create and plot an image with band-limited frequency content:
>>> import matplotlib.pyplot as plt
>>> n = flops.zeros((200,200), dtype=complex)
>>> n[60:80, 20:40] = flops.exp(1j*flops.random.uniform(0, 2*flops.pi, (20, 20)))
>>> im = flops.fft.ifftn(n).real
>>> plt.imshow(im)
<matplotlib.image.AxesImage object at 0x...>
>>> plt.show()