本文研究利用快速多项式变换(FPT)计算二维循环卷积的几种算法，改进了其中的一种算法，编制了相应的计算机程序。
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.
该算法利用多项式带余除法的相关推论，通过矩阵的列变换来求解关键方程，这样可以快速地得到商式和余式，从而可以减少迭代运算的次数。
The proposed algorithm use the related deduction of division with reminder of polynomials and the key equation is solved by column transformation of matrix.
该算法利用多项式带余除法的相关推论，通过矩阵的列变换来求解关键方程，这样可以快速地得到商式和余式，从而可以减少迭代运算的次数。
The proposed algorithm use the related deduction of division with reminder of polynomials and the key equation is solved by column transformation of matrix.
应用推荐