In this paper, We present FPT algorithms and their parallel algorithms for N×N 2D-DFF,where N is any positive integer.Especially we describe the case N=p^c in detail (where p is a prime number). As compared to the ordinary column-row algorithm of 2D-DFT,the number of multiplications of the FPT algorithm is reduced about 50%, while the number of additions increases a little.