|Table of Contents|

A Study on Finite length Deconvolution(PDF)

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
1998年01期
Page:
51-54
Research Field:
Publishing date:

Info

Title:
A Study on Finite length Deconvolution
Author(s):
Zhang Shengfu Wu Liguang Xia Zhiyun Zhang Ke Lu Jie
School of Electronic Engineering and Optoelectronic Technology,NUST, Nanjing 210094
Keywords:
inverse tr ansform iterat ion metho ds Z- t ransfo rm
PACS:
O174.22,TN911.1
DOI:
-
Abstract:
This paper discusses three methods for problem of finite-leng th deconvolutio n. The f irst method is cal led iter ative alg orithm for t ime domain, it s iterat iv e times are decided only by the length of unknown seriers. An impor tant resul t is that the iterat ive algor ithm has no problem o f conver gency. The secend algo rithm is suitable for the length of co nvo lut ion, point s of FFT are abo ut 2 t imes of the leng th of known series, it can save abo ut 33% computat ional cost compar ed to FFT . The third method is similar to the second, it can save 15% computat ional cost compared to FFT . So the metho ds g iv en in this paper are v ery simple and easy to prog ram.

References:

1 舒勤, 张有正. X ( k ) 有零点的卷积反演的DFT 算法. 电子学报. 1990, 18( 3) : 83~89
2 舒勤, 张有正. 再论X ( k ) 有零点的卷积反演的DFT 算法. 电子学报. 1992, 20( 12) : 79~81
3 孔凡年. 时域卷积反演的新方法. 电子学报. 1985, 13( 4) : 8~13

Memo

Memo:
-
Last Update: 2013-03-29