FFT，即为快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。-FFT, is the fast Fourier transform, discrete Fourier transform is a fast algorithm, which is the discrete Fourier transform of the odd, even, true, real and other characteristics of