论文部分内容阅读
本文研究了G.Bruun提出的复系数很少的FFT算法,确立了决定该算法输出位序的方法,实现了对该算法的公式化描述和程序设计。还探讨了该算法浮点实现时的有限字长影响,并进行了相应的计算机试验。
In this paper, G.ruun proposed the FFT algorithm with few complex coefficients, and established the method of determining the output sequence of the algorithm, and realized the formulaic description and programming of the algorithm. It also discusses the finite word length effect of the floating-point implementation of the algorithm, and carries out the corresponding computer test.