In this section, we will see how to compute the discrete Fourier transform and some of its applications.
Computing the discrete Fourier transform (DFT) of a data series using the FFT algorithm
How to do it…
In the following table, we will see the parameters to create a data series using the FFT algorithm:
Parameters |
x: array_like. Array to Fourier transform. n: int, optional. Length of the Fourier transform. If n < x.shape[axis], x is truncated. If n > x.shape[axis], x is zero-padded. The default results in n = x.shape[axis]. axis: int, optional. Axis along which the FFTs are computed; the default is over the last axis (that is, overwrite_x: Boolean, optional. If True, the contents of x can be destroyed... |