论文部分内容阅读
在已有的各种算法基础上,利用混合抽点法和广义数论变换,得到一种计算离散傅氏变换的快速算法,该算法由于大大减少了乘法运算而使速度和精度显著提高,在结构上呈模块化的通用结构,具有类似于 FFT 的蝶代运算,易于用硬软件实现,其结构上的递推性使之对较长序列的处理优于其它方法。运用本文的算法在 IBM PC 微机上实现了滤波。该算法还与同类算法进行了比较。
Based on the existing algorithms, a hybrid fast algorithm of discrete Fourier transform (FFT) is obtained by using the hybrid snapshot method and the generalized number theory transform. The speed and accuracy of the algorithm are greatly improved due to the greatly reduced multiplication. On the modular general structure, with the butterfly generation similar to FFT, easy to use hardware and software to achieve its structural recursion so that the treatment of longer sequences than other methods. The algorithm of this paper is used to filter the IBM PC. The algorithm is also compared with similar algorithms.