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, axis=-1). overwrite_x: Boolean, optional. If True, the contents of x can be destroyed; the default is False. |
| Returns |
z: complex ndarray with the elements: [y(0),y(1),..,y(n/2),y(1-n/2),...,y(-1)] if n is even Where: y(j) = sum[k=0..n-1] x[k] * exp(-sqrt(-1)*j*k* 2*pi/n), j = 0..n-1 Note that, y(-j) = y(n-j).conjugate(). |