Introduction - If you have any usage issues, please Google them yourself
FFT (Fast Fourier Transformation) is a fast algorithm for discrete Fourier transform (DFT). Is the fast Fourier transform. It is based on the discrete Fourier transform of the odd, even, virtual, real and other characteristics of the discrete Fourier transform algorithm to improve the obtained.