jax.numpy.fft.hfft(a, n=None, axis=-1, norm=None)[source]#

Compute the FFT of a signal that has Hermitian symmetry, i.e., a real

LAX-backend implementation of numpy.fft.hfft().

Original docstring below.


  • a (array_like) – The input array.

  • n (int, optional) – Length of the transformed axis of the output. For n output points, n//2 + 1 input points are necessary. If the input is longer than this, it is cropped. If it is shorter than this, it is padded with zeros. If n is not given, it is taken to be 2*(m-1) where m is the length of the input along the axis specified by axis.

  • axis (int, optional) – Axis over which to compute the FFT. If not given, the last axis is used.

  • norm ({"backward", "ortho", "forward"}, optional) –


out – The truncated or zero-padded input, transformed along the axis indicated by axis, or the last one if axis is not specified. The length of the transformed axis is n, or, if n is not given, 2*m - 2 where m is the length of the transformed axis of the input. To get an odd number of output points, n must be specified, for instance as 2*m - 1 in the typical case,

Return type: