Abstract
This paper is concerned with the definition of the discrete fractional Fourier transform (DFRFT). First, an eigendecomposition of the discrete Fourier transform (DFT) matrix is derived by sampling the Hermite Gauss functions, which are eigenfunctions of the continuous Fourier transform and by performing a novel error-removal procedure. Then, the result of the eigendecomposition of the DFT matrix is used to define a new DFRFT. Finally, several numerical examples are illustrated to demonstrate that the proposed DFRFT is a better approximation to the continuous fractional Fourier transform than the conventional defined DFRFT.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have