Abstract: A new recursive algorithm for Fast Fourier Transformation is proposed, which is derived and proven mathematically, Because of the arbitrariness in choosing the sections of input sequence and the times of recursion, this method is more flexible and leads to more precise results when applied to practical problems, The algorithm is easy to implement and can be extended to multi-dimensional cases.