A Fast Fourier Transform (FFT) is an efficient algorithm to compute the Discrete Fourier Transform (DFT) and its inverse. There are many distinct FFT algorithms involving a wide range of mathematics, from simple complex-number arithmetic to group the

时域基2快速傅里叶变换算法，在nios ii处理器中实现的一种 fft功能算法，可用于频谱分析。-Time domain radix-2 FFT algorithm, implemented in the nios ii processor features an fft algorithm can be used for spectral analysis.

Use matlab intelligent predictive control algorithm, Using matlab written narrowband noise occurs, Dual-line interpolation FFT harmonic analysis kaiser windows.