| 一种高效的高合成数快速Fourier变换算法 |
| |
| 引用本文： | 卢咸池.一种高效的高合成数快速Fourier变换算法[J].计算物理,1986,3(1):99-112. |
| |
| 作者姓名： | 卢咸池 |
| |
| 作者单位： | 北京大学地球物理系 |
| |
| 摘 要： | 本文概述了快速Fourier变换(FFT)的基本方法,着重讨论了高合成数FFT旋转因子算法。试验表明,由此编制的程序计算速度快、通用性强,具有实用价值。
|
| 收稿时间： | 1985-09-25 |
AN EFFICIENT HIGHLY COMPOSITE FFT ALGORITHM |
| |
| Lu Xian-chi.AN EFFICIENT HIGHLY COMPOSITE FFT ALGORITHM[J].Chinese Journal of Computational Physics,1986,3(1):99-112. |
| |
| Authors: | Lu Xian-chi |
| |
| Institution: | Department of Geophysics, Peking. University, Beijing |
| |
| Abstract: | In this paper some fundamental methods of fast Fourier transform (FFT) are mentioned with a highly composite twiddle factor FFT:algorithm discussed in particular. The computer program upon the algorithm with other measures, which can be used for both forward and backward Fourier transform of either complex or real sequence,has been shown to have remarkably faster transform speed, and so it will be useful in practical computational work. |
| |
| Keywords: | |
|
| 点击此处可从《计算物理》浏览原始摘要信息 |
| 点击此处可从《计算物理》下载免费的PDF全文 |
|
