基于递归法的FFT计算机仿真

Computer simulating of FFT based on recursion

为了有效和快速地对信号进行处理和分析,常常需要对原始信号进行快速傅里叶变换,从而可以利用频域中的一些性质对信号进行处理。目前FFT的计算机普遍实现大都是采用蝶形算法,但是理解上比较晦涩难懂。为此提出了一种基于递归法实现的算法,实验结果表明,该算法结构清晰,易于理解。

For processing signal fleetly and analyzing effectively, fast fourier transform method is used to process signal through making use of some character in frequency domain. Butterfly shaping arithmetic is used largely at present. However, this arithmetic is a little hard for reading and understanding. So, arithmetic is introduced basing on recursion. The experiment results illuminated that this method has a clear structure and is easy to comprehend.