快速傅立叶变换的matlab算法实现。（是一个按照时间抽取的基-2快速傅里（基-2 FFT-DIT）。输入倒位序，输出自然顺序。-Fast Fourier Transform algorithm matlab. (Which is a time of extraction in accordance with the base-2 Fast Fu-ri (base-2 FFT-DIT). Enter the inversion sequence, the output of natural or

乘法器。fft。 基2.蝶形运算。旋转因子-Multipliers. fft. Group 2 butterfly. Twiddle factor

C语言实现几种不同FFT的方法：其中包括时间抽取的基2 DFT，频率抽取的基2 DFT，分裂基算法、CZT方法等。-C language implementation of several different FFT approach: including the time taken by the base 2 DFT, frequency extraction base 2 DFT, split based algorithm, CZT methods.

基于基2的蝶型FFT，用C实现，经过测试，没有错误，可以直接拿去使用。-Based on base 2 FFT butterfly type, use C implementation, after testing, there is no error, can be directly used.