Closed-form discrete fractional and affine Fourier transforms

The discrete fractional Fourier transform (DFRFT) is the generalization of discrete Fourier transform. Many types of DFRFT have been derived and are useful for signal processing applications. In this paper, we will introduce a new type of DFRFT, which are unitary, reversible, and flexible; in addition, the closed-form analytic expression can be obtained, It works in performance similar to the continuous fractional Fourier transform (FRFT) and can be efficiently calculated by FFT. Since the continuous FRFT can be generalized into the continuous affine Fourier transform (AFT) (the so-called canonical transform), we also extend the DFRFT into the discrete affine Fourier transform (DAFT). We will derive two types of the DFRFT and DAFT, Type I: will be similar to the continuous FRFT and AFT and can be used for computing the continuous FRFT and AFT. Type 2 is the improved form of type 1 and can be used for other applications of digital signal processing, Meanwhile, many important properties continuous FRFT and AFT are kept in closed-form DFRFT and DAFT, and some applications, such as the filter design and pattern recognition, will also be discussed. The closed-form DFRFT we introduce will have the lowest complexity among all current DFRFT's that are still similar to the continuous FRFT.