In this paper, algorithms for computing 2-d circular convolution by using Fast Polynomial Transform (FPT) are reviewed and discussed, and then an improved algorithm is presented.
本文研究利用快速多项式变换(FPT)计算二维循环卷积的几种算法，改进了其中的一种算法，编制了相应的计算机程序。
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.
本文将FPT和FNT相结合提出了一种计算超大型二维循环卷积的迭代算法，它的基础是应用了FPT。
应用推荐