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)计算二维循环卷积的几种算法；改进了其中的一种算法；编制了相应的计算机程序.