Fast polynomial transform and its implementation by computer

Recently a new algorithm was developed to compute two-dimensional cyclic convolution by what is called the FPT (fast polynomial transform) algorithm. In this paper this new algorithm is further studied and implemented on a general purpose computer. Methods to cope with finite core memory limitations are presented and actual computational speed performances are listed.