| 一种实序列FFT新算法与C语言实现 |
| |
| 引用本文： | 陈飞,岳宁,吴林峰.一种实序列FFT新算法与C语言实现[J].太赫兹科学与电子信息学报,2008,6(6). |
| |
| 作者姓名： | 陈飞 岳宁 吴林峰 |
| |
| 作者单位： | 四川大学吴玉章学院,四川,成都,610035 |
| |
| 摘 要： | 实际中需做快速傅里叶变换(FFT)的多为实序列数据,而其变换算法都是以复数序列作为输入。文中利用频域的性质,将实序列数据变换为复数序列,再进行FFT变换,以提高FFT对于实序列输入的变换效率,最后用C语言实现该算法并与传统算法进行实验对比,从结果可看到优化后效率提高很多。
|
| 关 键 词： | 快速傅里叶变换 实数序列 复数序列 快速算法 C语言 |
A New FFT Algorithm with Real Input and Implementation in C Language |
| |
| CHEN Fei,YUE Ning,WU Lin-feng.A New FFT Algorithm with Real Input and Implementation in C Language[J].Journal of Terahertz Science and Electronic Information Technology,2008,6(6). |
| |
| Authors: | CHEN Fei YUE Ning WU Lin-feng |
| |
| Abstract: | FFT algorithm with complex sequences as input is commonly applied to real sequence. A new FFT algorithm is proposed,which depends on the characters of the frequency 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. |
| |
| Keywords: | FFT real sequence complex sequence fast algorithm C language |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《太赫兹科学与电子信息学报》浏览原始摘要信息 |
| 点击此处可从《太赫兹科学与电子信息学报》下载免费的PDF全文 |
|
