In this paper，two algorithms of Fast Polynomial Transforms are developed. The number of times of addition needed for them is A_d=MN²log₂N Then，the implementation of FPT on general computer is discussed and a detialed block diagram given. A FORTRAN program is also given in the appendix.