二次幂FFT的改进QFT算法
Improved QFT algorithm for power-of-two FFT
摘要：
本文证明了对快速傅里叶变换（QFT）算法稍加修改，就可以改善其计算量、内存要求和精度。新算法需要相同数量的加法和乘法的分裂基3add/3 mul，在文献中出现的最受欢迎的FFT算法之一，但只使用一半的三角常数。这些结果可以将QFT方法提升到大多数使用的FFT程序的水平。提出了一种新的基于信号类型和特殊符号的通用FFT算法描述方法，突出了它的优点。
英文摘要：
This paper shows that it is possible to improve the computational cost, the memory requirements and the accuracy of Quick Fourier Transform (QFT) algorithm for power-of-two FFT (Fast Fourier Transform) just introducing a slight modification in this algorithm. The new algorithm requires the same number of additions and multiplications of split-radix 3add/3mul, one of the most appreciated FFT algorithms appeared in the literature, but employing only half of the trigonometric constants. These results can elevate the QFT approach to the level of most used FFT procedures. A new quite general way to describe FFT algorithms, based on signal types and on a particular notation, is also proposed and used, highligting its advantages.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
