Key points are not available for this paper at this time.
An algorithm for efficient and accurate computation of the fractional Fourier transform is given. For signals with time-bandwidth product N, the presented algorithm computes the fractional transform in O(NlogN) time. A definition for the discrete fractional Fourier transform that emerges from our analysis is also discussed.
Özaktaş et al. (Sun,) studied this question.