论文部分内容阅读
本文提出一种FFT新算法,其计算量不大于现有的各种基2DFT算法.然后,与Winograd小DFT(4,8,16点)结合使用,得出一种计算DFT的最快速算法.
In this paper, we propose a new FFT algorithm that does not require more computations than existing 2DFT algorithms, and then use it in conjunction with Winograd DFTs (4, 8, and 16) to arrive at a quickest algorithm for computing DFTs.