| 利用快速多项式变换计算二维卷积的算法改进 |
| |
| 引用本文： | 胡光锐.利用快速多项式变换计算二维卷积的算法改进[J].上海交通大学学报,1986(6). |
| |
| 作者姓名： | 胡光锐 |
| |
| 作者单位： | 上海交通大学电子工程系 |
| |
| 摘 要： | 本文研究利用快速多项式变换(FPT)计算二维循环卷积的几种算法,改进了其中的一种算法,编制了相应的计算机程序.同直接算法及二维FFT算法进行了运行时间比较,得到了满意的结果.
|
| 关 键 词： | 数字信号处理 多项式变换 二维卷积 快速多项式变换 快速算法 |
An Improved Fast Polynomial Transform Algorithm for 2-D Convolution Computation |
| |
| Hu Guangrui.An Improved Fast Polynomial Transform Algorithm for 2-D Convolution Computation[J].Journal of Shanghai Jiaotong University,1986(6). |
| |
| Authors: | Hu Guangrui |
| |
| Institution: | Hu Guangrui |
| |
| Abstract: | In this paper, algorithms for computing 2-D circular convolution by using Fast Polynomial Transform (FPT) are reviewed and discussed, and then an improved algorithm is presented. The computer programs are compared with the direct and 2-D FFT algorithms in actual computer execution time. The results are satisfactory. |
| |
| Keywords: | fast polynomial transform (FPT) polynomial transform (PT) twodimensional convolution fast transform algorithms 2-D convolution |
| 本文献已被 CNKI 等数据库收录！ |
