| 引用本文: | 田泽荣,蒋增荣.多元多项式乘积的 FPT算法.[J].国防科技大学学报,1991,13(3):108-112.[点击复制] |
| Tian Zerong,Jiang Zengrong.The FPT Algorithm of Multi-variabl Polynomial Multiplication[J].Journal of National University of Defense Technology,1991,13(3):108-112[点击复制] |
|
| |
|
|
| 本文已被：浏览 5818次 下载 5741次 |
| 多元多项式乘积的 FPT算法 |
| 田泽荣1, 蒋增荣2 |
|
(1.计算机系;2.系统工程与应用数学系)
|
| 摘要: |
| 本文详细讨论了多元多项式乘积的多项式变换 (FPT) 算法。首先给出了二元的情况，然后推广到了一般多元多项式，最后给出了这种算法在计算二维循环卷积中的应用，由此可见，这种算法在计算多维卷积和多维 DFT时是很有效的。 |
| 关键词: 卷积，多项式变换，多元多项式 |
| DOI： |
| 投稿日期：1990-03-09 |
| 基金项目: |
|
| The FPT Algorithm of Multi-variabl Polynomial Multiplication |
| Tian Zerong1, Jiang Zengrong2 |
|
(1.Department of Computer Science;2.Department of Applied Mathematics and System Engineering)
|
| Abstract: |
| In this paper，we discussed the FPT algorithm of multi-variable polynomial multiplication in detail. Firstly，we give the case of two-variable. Secondary，we generalize it to multi-variable polynomial. At last，we apply it to the computation of the two dimensional cyclic convolution. As a result，this kind of algorithm is efficient in computation of M-D DFTs and M-D convolutions. |
| Keywords: convolution,polynomial transform,multi-varialbe polyomial |
|
|
