论文部分内容阅读
本文介绍用素因子算法计算离散付里叶变换的汇编程序。对于长变换,素因子算法是一种有效的计算方法。素因子算法的运算速度比Cooley—Tukes的基2FFT算法和Winograd的嵌套结构算法都要快。
This article introduces a factorial algorithm to calculate the discrete Fourier transform assembler. For long shifts, the prime factor algorithm is an efficient method of calculation. The prime factor algorithm operates faster than both Cooley-Tukes’ base-2FFT algorithm and Winograd’s nested-structure algorithm.