scipy 1.8.0 Pypi GitHub Homepage
Other Docs
NotesParametersRaisesReturnsBackRef

This function computes the N-D discrete Fourier Transform over any axes in an M-D array by means of the Fast Fourier Transform (FFT). By default, the transform is computed over the last two axes of the input array, i.e., a 2-dimensional FFT.

Notes

fft2 is just fftn with a different default for :None:None:`axes`.

The output, analogously to fft , contains the term for zero frequency in the low-order corner of the transformed 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 the axes, in order of decreasingly negative frequency.

See fftn for details and a plotting example, and fft for definitions and conventions used.

Parameters

x : 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 to n for fft(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.

axes : sequence of ints, optional

Axes over which to compute the FFT. If not given, the last two axes are used.

norm : {"backward", "ortho", "forward"}, optional

Normalization mode (see fft ). Default is "backward".

overwrite_x : bool, optional

If True, the contents of x can be destroyed; the default is False. See fft for more details.

workers : int, optional

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.

plan : object, optional

This argument is reserved for passing in a precomputed plan provided by downstream FFT vendors. It is currently not used in SciPy.

versionadded

Raises

ValueError

If s and :None:None:`axes` have different length, or :None:None:`axes` not given and len(s) != 2 .

IndexError

If an element of :None:None:`axes` is larger than than the number of axes of x.

Returns

out : complex ndarray

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 discrete Fourier Transform

See Also

fft

The 1-D FFT.

fftn

The N-D FFT.

fftshift

Shifts zero-frequency terms to the center of the array. For 2-D input, swaps first and third quadrants, and second and fourth quadrants.

ifft2

The inverse 2-D FFT.

Examples

>>> import scipy.fft
... x = np.mgrid[:5, :5][0]
... scipy.fft.fft2(x) array([[ 50. +0.j , 0. +0.j , 0. +0.j , # may vary 0. +0.j , 0. +0.j ], [-12.5+17.20477401j, 0. +0.j , 0. +0.j , 0. +0.j , 0. +0.j ], [-12.5 +4.0614962j , 0. +0.j , 0. +0.j , 0. +0.j , 0. +0.j ], [-12.5 -4.0614962j , 0. +0.j , 0. +0.j , 0. +0.j , 0. +0.j ], [-12.5-17.20477401j, 0. +0.j , 0. +0.j , 0. +0.j , 0. +0.j ]])
See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

scipy.fft._basic.fftn scipy.fft._basic.ifft2 scipy.fft._basic.fft scipy.fft._basic.fft2

Local connectivity graph

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


GitHub : /scipy/fft/_basic.py#822
type: <class 'uarray._Function'>
Commit: