| 应用数论变换的快速DFT算法及其微机实现 |
| |
| 引用本文： | 万征,黄振兴.应用数论变换的快速DFT算法及其微机实现[J].电子科技大学学报(社会科学版),1990(3). |
| |
| 作者姓名： | 万征 黄振兴 |
| |
| 作者单位： | 电子科技大学电子工程系
(万征)，电子科技大学电子工程系(黄振兴) |
| |
| 摘 要： | 在已有的各种算法基础上,利用混合抽点法和广义数论变换,得到一种计算离散傅氏变换的快速算法,该算法由于大大减少了乘法运算而使速度和精度显著提高,在结构上呈模块化的通用结构,具有类似于 FFT 的蝶代运算,易于用硬软件实现,其结构上的递推性使之对较长序列的处理优于其它方法。运用本文的算法在 IBM PC 微机上实现了滤波。该算法还与同类算法进行了比较。
|
| 关 键 词： | 滤波器 数论 蝶形 模块结构 快速算法 计算机应用 混合抽点 |
FAST DFT ALGORITHM USING NUMBER THEORY TRANSFORM AND ITS REALIZATION |
| |
| Wan Zheng,Huang Zhengxing.FAST DFT ALGORITHM USING NUMBER THEORY TRANSFORM AND ITS REALIZATION[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),1990(3). |
| |
| Authors: | Wan Zheng Huang Zhengxing |
| |
| Institution: | Dept.of Electronic Engineering |
| |
| Abstract: | This paper proposes a new fast Discrete Fourier Transform(DFT)algorithm on the basis of many kinds of DFT algorithms.By using mixedtime/frenquency decimation and number theory transform,most of mutiplicationsturn to plus or minus to minimize the mutiplicative complexity,so the computingspeed and accuracy of DFT is greatly increased.This algorithm is in common modelblock with butterfly structure similar to classical FFT,so it is easy to realize filteringin computer by hardware and/or software.Comparing with Rader's and FFTalgorithm,it has much higher speed and accurancy and is much more suitable forlonger length signal.Therefore using this algorithm,the filtering is realized onIBM-PC microcomputer.As a result,it is an efficient DFT algorithm. |
| |
| Keywords: | filter number theory butterfly block structure fast algorithm computer application mixed decimation |
| 本文献已被 CNKI 等数据库收录！ |
