Introduction - If you have any usage issues, please Google them yourself
Fast Fourier transform (FFT) is a fast algorithm for discrete Fourier transform. It is based on the characteristics of discrete Fourier transform, such as odd, even, virtual and real, and improves the algorithm of discrete Fu Liye transform. It has not found any new discoveries in the theory of Fourier transformation, but it is a great step to apply discrete Fu Liye transform in computer system or digital system.