摘要
实际中需做快速傅里叶变换(FFT)的多为实序列数据,而其变换算法都是以复数序列作为输入。文中利用频域的性质,将实序列数据变换为复数序列,再进行FFT变换,以提高FFT对于实序列输入的变换效率,最后用C语言实现该算法并与传统算法进行实验对比,从结果可看到优化后效率提高很多。
FFT algorithm with complex sequences as input is commonly applied to real sequence. A new FFT algorithm is proposed, whieh depends on the eharacters of the frequeney domain, transforms real into complex sequences as input to improve the efficiency of FFT. The algorithm is programmed in C language and compared with the unoptimized. The result indicates that the new algorithm does improve the transformation efficiency.
出处
《信息与电子工程》
2008年第6期437-439,452,共4页
information and electronic engineering
