Implementation of fast algorithm of discrete fractional Fourier transform on DSP

In order to meet the requirement of DFRFT(discrete fractional Fourier transform) real-time computation on DSP(digital signal processor), several DFRFT computation methods are compared and the Ozaktas′s DFRFT fast algorithm is chosen to do the implementation processing based on DSP. On the basis of theoretical analysis for the fast algorithm, the computation procedure of fast algorithm is optimized, and the complete statistical result of the implementation is given. The amount of real number multiplication computation can be minimized by the proposed fast algorithm for the given accuracy. Engineering practice proves that this solution meets the accuracy requirement and real-time property of DSP computation.