| 任意长二维 DFT 的多项式变换算法及其并行算法 |
| |
| 引用本文： | 蒋增荣,付彬. 任意长二维 DFT 的多项式变换算法及其并行算法[J]. 国防科技大学学报, 1995, 17(1): 97-103 |
| |
| 作者姓名： | 蒋增荣 付彬 |
| |
| 作者单位： | 国防科技大学系统工程与数学系，湖南大学 |
| |
| 摘 要： | 本文给出任意长二维ＤＰＴ的ＦＰＴ算法及其并行算法，详细地讨论了Ｎ＝ｐ￣ｅ的情况（ｐ为素数）。与通常二维ＤＦＴ的行列算法比较，乘法量减少约５０％，加法量略有增加。
|
| 关 键 词： | 离散富里叶变换（DFT），快速多项式变换（FPT） |
| 收稿时间： | 1994-03-21 |
Fast Polynomail Transform Algorithms and Parallel Algorithms for Two-Dimensional DFT of Arbitrary Length |
| |
| Jiang Zengrong and Fu Bin. Fast Polynomail Transform Algorithms and Parallel Algorithms for Two-Dimensional DFT of Arbitrary Length[J]. Journal of National University of Defense Technology, 1995, 17(1): 97-103 |
| |
| Authors: | Jiang Zengrong and Fu Bin |
| |
| Affiliation: | Department of System Enginaering and Mathematics |
| |
| Abstract: | In this paper, We present FPT algorithms and their parallel algorithms for N×N 2D-DFF,where N is any positive integer.Especially we describe the case N=pc in detail (where p is a prime number). As compared to the ordinary column-row algorithm of 2D-DFT,the number of multiplications of the FPT algorithm is reduced about 50%, while the number of additions increases a little. |
| |
| Keywords: | ss:Discrete Foutier Transform (DFT) Fast Polynomial Transform(FPT) |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
|
点击此处可从《国防科技大学学报》下载免费的PDF全文 |
