用汇编写的fft变换程序，采用128点的fft，里面有采集数据，适合毕业设计用-Fft transform with a compilation of written procedures, using 128-point fft, which has collected data used for graduation

一个fft的例子，我的毕业设计就采用的是这个程序，可以-A fft example, my graduation is on the use of this procedure, you can see

设计一个按时间抽取的输入倒位序输出顺序的基2—fft算法程序。-Time taken by designing an inversion input sequence output sequence of the base 2-fft algorithm.

快速傅里叶变换法（FFT）是离散傅立叶变换的一种快速计算方法，它能使N点DFT的乘法计算量由N2 次降为 次。下图是采样点数为8点FFT时间抽取算法信号流图，本程序也是以这种形式设计的。-Fast Fourier Transform (FFT) is a fast computational method for discrete Fourier transforms that can reduce the multiplication of N-point DFT by N2 times. T