| 有限长卷积反演问题研究 |
| |
| 引用本文： | 张胜村 吴黎光. 有限长卷积反演问题研究[J]. 南京理工大学学报(自然科学版), 1998, 22(1): 47-50 |
| |
| 作者姓名： | 张胜村 吴黎光 |
| |
| 作者单位： | 南京理工大学电子工程与光电技术学院 |
| |
| 摘 要： | 该文讨论解有限长序列卷积反演的３种方法－一种为时域迭代算法，它根据待求序列长度决策迭代次数，且不存在迭代收敛问题，另一种方法适合于卷积长度，ＦＦＴ点数大约是原卷积序列长度的两倍这种情形，它比经典ＦＦＴ方法节约３３％的计算量，第３种方法与第２种类似，也可节约１５％计量量。与其它方法相比，该文的方法简单易行，运算量少。
|
| 关 键 词： | 逆变换 迭代算法 Z变换 卷积反演 FFT |
A Study on Finite length Deconvolution |
| |
| Zhang Shengfu Wu Liguang Xia Zhiyun Zhang Ke Lu Jie. A Study on Finite length Deconvolution[J]. Journal of Nanjing University of Science and Technology(Nature Science), 1998, 22(1): 47-50 |
| |
| Authors: | Zhang Shengfu Wu Liguang Xia Zhiyun Zhang Ke Lu Jie |
| |
| Abstract: | This paper discusses three methods for problem of finite length deconvolution. The first method is called iterative algorithm for time domain, its iterative times are decided only by the length of unknown seriers. An important result is that the iterative algorithm has no problem of convergency. The secend algorithm is suitable for the length of convolution, points of FFT are about 2 times of the length of known series, it can save about 33% computational cost compared to FFT. The third method is similar to the second, it can save 15% computational cost compared to FFT. So the methods given in this paper are very simple and easy to program. |
| |
| Keywords: | inverse transform iteration methods Z-transform |
| 本文献已被 CNKI 维普 等数据库收录！ |
