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

Compute the one-dimensional discrete Fourier Transform.

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

Original docstring below.

This function computes the one-dimensional n-point discrete Fourier Transform (DFT) with the efficient Fast Fourier Transform (FFT) algorithm [CT].

  • a (array_like) – Input array, can be complex.

  • n (int, optional) – Length of the transformed axis of the output. If n is smaller than the length of the input, the input is cropped. If it is larger, the input is padded with zeros. If n is not given, the length of the input along the axis specified by axis is used.

  • 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.

Return type:

complex ndarray



Cooley, James W., and John W. Tukey, 1965, “An algorithm for the machine calculation of complex Fourier series,” Math. Comput. 19: 297-301.