An improved FPT algorithm for computing two-dimensional cyclic convolutions

In this correspondence the fast polynomial transform (FPT) algorithm for two-dimensional cyclic convolutions in [6], [7] is improved. These improvements result from reduction of the complexity of polynomial products, modulo (z
^K
+ 1), and the decomposition and reconstruction by the Chinese remainder theorem. With these improvements the FPT can be performed with a more regular and modular structure.