引用本文: | 蒋增荣,付彬.任意长二维 DFT 的多项式变换算法及其并行算法[J].国防科技大学学报,1995,17(1):97-103.[点击复制] |
Jiang Zengrong,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[点击复制] |
|
|
|
本文已被:浏览 6231次 下载 6221次 |
任意长二维 DFT 的多项式变换算法及其并行算法 |
蒋增荣, 付彬 |
(国防科技大学 系统工程与数学系 湖南 长沙 410073)
|
摘要: |
本文给出任意长二维 DPT的 FPT 算法及其并行算法,详细地讨论了 N=pc的情况(p为素数)。与通常二维 DFT的行列算法比较,乘法量减少约 50% ,加法量略有增加。 |
关键词: 离散富里叶变换(DFT),快速多项式变换(FPT) |
DOI: |
投稿日期:1994-03-21 |
基金项目:国防预研基金资助项目 |
|
Fast Polynomail Transform Algorithms and Parallel Algorithms for Two-Dimensional DFT of Arbitrary Length |
Jiang Zengrong, Fu Bin |
(Department of Systems Engineering 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: Discrete Foutier Transform (DFT), Fast Polynomial Transform(FPT) |
|
|