| 基于递归计算DFT的反卷积高速算法 |
| |
| 引用本文： | 曹珍富.基于递归计算DFT的反卷积高速算法[J].哈尔滨工业大学学报,1997,29(6):4-6,13. |
| |
| 作者姓名： | 曹珍富 |
| |
| 作者单位： | 哈尔滨工业大学数学系 |
| |
| 摘 要： | 提出计算反卷积的一种高速算法，该算法将使其运算的乘法次数大为减少，而相应的加法和除法次数与已有的快速算法相当。
|
| 关 键 词： | 离散付立叶变换 反卷积 递归算法 重排 信号处理 |
Very High Speed Deconvolution Based on the Recursively Computing DFTs |
| |
| Cao Zhenfu.Very High Speed Deconvolution Based on the Recursively Computing DFTs[J].Journal of Harbin Institute of Technology,1997,29(6):4-6,13. |
| |
| Authors: | Cao Zhenfu |
| |
| Affiliation: | Dept.of Mathematics |
| |
| Abstract: | A very high speed algorithm for computing deconvolution is presented.Compared with the other fast algorithms(for example,the algorithm of deconvolution with FFT),this algorithm is decreasing from 3N log 2N to 3 in the number of multiplication operations and is the same in plus and division. |
| |
| Keywords: | Discrete Fourier transition deconvolution recurrence algorithm rearrange |
| 本文献已被 CNKI 维普 等数据库收录！ |
