| 引用本文: | 蒋增荣,余品能.DFT的Z变换算法.[J].国防科技大学学报,1989,11(1):90-100.[点击复制] |
| Jiang Zengrong,Yu Pinneng.An Algorithm on Z-Transform for DFT[J].Journal of National University of Defense Technology,1989,11(1):90-100[点击复制] |
|
| |
|
|
| 本文已被：浏览 5256次 下载 5289次 |
| DFT的Z变换算法 |
| 蒋增荣1, 余品能2 |
|
(1.国防科技大学;2.南京工程兵学院)
|
| 摘要: |
| 文中讨论了用Z变换计算DFT的方法。对于N=2t的DFT，本算法所需的加法及乘法量分别为：A=3Nlog2N-2N，M=3/2Nlog2N-3N+4。与Cooley-Tukey基-2算法比较，乘法量与加法量均减少25﹪。文中还讨论了本算法在微机上的实现，给出流程图。在运算时间上，本算法与通用FFT算法程序进行比较，节省时间30﹪。 |
| 关键词: 离散富里叶变换(DFT),z-变换，快速富里叶变换(FFT) |
| DOI： |
| 投稿日期：1988-04-07 |
| 基金项目: |
|
| An Algorithm on Z-Transform for DFT |
|
(1.National University of Defense Technology)
|
| Abstract: |
| In this paper，the method of computing DFT with Z-transform is discussed. The amount of additions and multiplications operating N=2t point DFT is remarkably decreased compared with the Cooley-Tukey's radix-2 FFT algorithm. The implementation of this algorithm on IBM-PC is discussed. The comparison of this two algorithms running time is given. |
| Keywords: discrete fourier transform (DFT),Z-transform,fast fourier tranform (FFT) |
|
|
