| Toeplitz矩阵相乘的快速卷积算法 |
| |
| 引用本文： | 余品能,路凌云.Toeplitz矩阵相乘的快速卷积算法[J].计算机应用与软件,1997,14(5):43-48. |
| |
| 作者姓名： | 余品能 路凌云 |
| |
| 作者单位： | [1]南京工程兵工学院 [2]总参63所 |
| |
| 摘 要： | 本文利用Ｔｏｅｐｌｉｔｚ矩阵可分解为循环阵与斜循环阵之和的特点２，借助于卷积的ＦＦＴ算法，推导出计算两个Ｔｏｅｐｌｉｔｚ矩阵之积的一种新的快速算法，其乘法复杂性为２ｎ＾２＋Ｏ（ｎｌｏｇ２ｎ）。
|
| 关 键 词： | Toeplitz矩阵 傅里叶变换 卷积 算法 |
A FAST CONVOLUTION ALGORITHM FOR PRODUCTS OF TOEPLITZ MATRICES |
| |
| YU PINNENG.A FAST CONVOLUTION ALGORITHM FOR PRODUCTS OF TOEPLITZ MATRICES[J].Computer Applications and Software,1997,14(5):43-48. |
| |
| Authors: | YU PINNENG |
| |
| Abstract: | Base on a Toeplitz matrix's decomposition into the sum of cyclio matrix and skew-cyclic matrix, the fast Fourier transform (FFT) algorithm for convolutions is constructed. This paper presents a new fast algorithm for products of Toeplitz matrices, its multiplicative complexity is 2n2 O(nlog2n). |
| |
| Keywords: | Toeplitz matrices fast Fourier transform (FFT) convolution arithmetic complexity |
| 本文献已被 CNKI 维普 等数据库收录！ |
