The discrete fractional Fourier transformation

Abstract

Based on the fractional Fourier transformation of sampled periodic functions, the discrete form of the fractional Fourier transformation is obtained. It is found that for a certain dense set of fractional orders it is possible to define a discrete transformation. Also, for its efficient computation a fast algorithm, which has the same complexity as the FFT, is given.