| 摘要: |
| 本文提出一种FFT新算法,其计算量不大于现有的各种基2DFT算法.然后,与Winograd小DFT(4,8,16点)结合使用,得出一种计算DFT的最快速算法. |
| 关键词: 离散傅里叶变换,快速算法 |
| DOI： |
|
| 基金项目: |
|
| Very fast computation of the radix-2 discrete Fourier transform |
|
| () |
| Abstract: |
| This paper proposes a new algorithm of FFT,Whose computing quantities are not greater than existent various radix-2 discrete Fourier transform(DFT) algorithms.Then,combination with Winograd's small DFT(point 4,8,16),a very fast computation method of DFT can be achieved. |
| Key words: Discrete Fourier Transform,Fast Algorithms |
