| 引用本文: | 蒋增荣,赵殿阳.快速多项式变换(FPT)及其在计算机上的实现.[J].国防科技大学学报,1986,(1):113-122.[点击复制] |
| Jiang Zengrong,Zhao Dianyang.Fast Polynomial Transforms and It's Implemetation on General Computer[J].Journal of National University of Defense Technology,1986,(1):113-122[点击复制] |
|
| |
|
|
| 本文已被：浏览 5253次 下载 5519次 |
| 快速多项式变换(FPT)及其在计算机上的实现 |
| 蒋增荣, 赵殿阳 |
|
()
|
| 摘要: |
| 本文首先推导了两种快速多项式(FPT)算法，所需加法次数均为Ad=MN2log2N然后讨论了FPT在计算机上的实现，给出了详细框图。在附录中给出了FPT的FORTRAN源程序。 |
| 关键词: |
| DOI： |
| 投稿日期：1984-03-26 |
| 基金项目: |
|
| Fast Polynomial Transforms and It's Implemetation on General Computer |
| Jiang Zengrong, Zhao Dianyang |
| Abstract: |
| In this paper，two algorithms of Fast Polynomial Transforms are developed. The number of times of addition needed for them is
Ad=MN2log2N Then，the implementation of FPT on general computer is discussed and a detialed block diagram given. A FORTRAN program is also given in the appendix. |
| Keywords: |
|
|
