In this paper，we discussed the FPT algorithm of multi-variable polynomial multiplication in detail. Firstly，we give the case of two-variable. Secondary，we generalize it to multi-variable polynomial. At last，we apply it to the computation of the two dimensional cyclic convolution. As a result，this kind of algorithm is efficient in computation of M-D DFTs and M-D convolutions.