Novel fast algorithm for fractional Fourier transform

The definition of the Fractional Fourier Transform (FRFT) is presented in the paper. Several fast algorithms of discrete FRFT are reviewed. The performances of these algorithms are analyzed briefly. Based on this analysis, a new algorithm for efficient and accurate computation of FRFT is given. This algorithm does not consider the match between eigenvalues and eigenvectors. There are some advantages such as easily understanding and implementing with excellent effect. And if the rotational angle is changed, only a diagonal matrix should be recomputed. A few simulation results for some typical signals are provided to compare with previous ones by other methods in the end.