摘要
本文将FPT和FNT相结合提出了一种计算超大型二维循环卷积的迭代算法,它的基础是应用了FPT.与二维循环卷积的FPT算法相比,乘法量减少了一个数量级,同时实际取消了FNT算法中卷积规模所受到的字长的限制.
On the basis of FPT, in this paper we introduce an iteration algorithm for computing hyper-large scale 2-D cyclic convolutions by combining FPT with FNT. As compared with the FPT algorithm for 2-D cyclic convolutions, the amount of multiplications of the algorithm introduced here decreases by one order of magnitude, and also it relieves the strict restriction of word length about cyclic convolution scale in FNT algorithm of 2-D cyclic convolutions.
出处
《高校应用数学学报（A辑）》
CSCD
北大核心
1991年第4期530-537,共8页
Applied Mathematics A Journal of Chinese Universities(Ser.A)
基金
国防科技大学基础理论研究基金
