Combined FPT-FNT Algorithm for Computing Two-dimensional Cyclic Convolutions

in this paper, a new combined Fast Polynomial Transform and Fermat Number Transform (FPT-FNT) algorithm is proposed for computing two-dimensional cyclic convolutions. It is shown that this algorithm is very efficient, it requires only NxN multiplications for computing two-dimensional cyclic convolution of two NxN sequences.