bundles / scipy 2.0.0.dev0+git20260907.41eeb59 / scipy / fft / _basic / hfft2
_Function
scipy.fft._basic:hfft2
source: build-install/usr/lib/python3.14/site-packages/scipy/fft/_basic.py:1525
Signature
def hfft2(x, s = None, axes = (-2, -1), norm = None, overwrite_x = False, workers = None, *, plan = None)Summary
Compute the 2-D FFT of a Hermitian complex array.
Parameters
x: arrayInput array, taken to be Hermitian complex.
s: sequence of ints, optionalShape of the real output.
axes: sequence of ints, optionalAxes over which to compute the FFT.
norm: {"backward", "ortho", "forward"}, optionalNormalization mode (see fft). Default is "backward".
overwrite_x: bool, optionalIf True, the contents of
xcan be destroyed; the default is False. See fft for more details.workers: int, optionalMaximum number of workers to use for parallel computation. If negative, the value wraps around from
os.cpu_count(). See fft for more details.plan: object, optionalThis argument is reserved for passing in a precomputed plan provided by downstream FFT vendors. It is currently not used in SciPy.
Returns
out: ndarrayThe real result of the 2-D Hermitian complex real FFT.
Notes
This is really just hfftn with different default behavior. For more details see hfftn.
Examples
import scipy.fft import numpy as np x = np.array([[1+0j, 2+0j], [2+0j, 1+0j]]) # Hermitian-symmetric input scipy.fft.hfft2(x, s=(2, 2))✓
array([[ 6., 0.],
[ 0., -2.]])
See also
- hfftn
Compute the N-D discrete Fourier Transform for Hermitian complex input.
Aliases
scipy.fft.hfft2