This function computes the inverse of the 2-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, ifft2(fft2(x)) == x
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.
ifft2
is just ifftn
with a different default for :None:None:`axes`.
See ifftn
for details and a plotting example, and fft
for definition 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 ifft2
is called.
Input array, can be complex.
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 :None:None:`axes` is used. See notes for issue on ifft
zero padding.
Axes over which to compute the FFT. If not given, the last two axes are used.
Normalization mode (see fft
). Default is "backward".
If True, the contents of x can be destroyed; the default is False. See fft
for more details.
Maximum number of workers to use for parallel computation. If negative, the value wraps around from os.cpu_count()
. See ~scipy.fft.fft
for more details.
This argument is reserved for passing in a precomputed plan provided by downstream FFT vendors. It is currently not used in SciPy.
If s and :None:None:`axes` have different length, or :None:None:`axes` not given and len(s) != 2
.
If an element of :None:None:`axes` is larger than than the number of axes of x.
The truncated or zero-padded input, transformed along the axes indicated by :None:None:`axes`, or the last two axes if :None:None:`axes` is not given.
Compute the 2-D inverse discrete Fourier Transform.
fft
The 1-D FFT.
fft2
The forward 2-D FFT, of which :None:None:`ifft2` is the inverse.
ifft
The 1-D inverse FFT.
ifftn
The inverse of the N-D FFT.
>>> import scipy.fftSee :
... x = 4 * np.eye(4)
... scipy.fft.ifft2(x) 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]])
The following pages refer to to this document either explicitly or contain code examples using this.
scipy.fft._basic.ifft
scipy.fft._basic.ifft2
scipy.fft._basic.fft2
scipy.fft._basic.ifftn
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them