Discrete Fractional Fourier Transform Algorithm Based on New Eigendcomposition Algorithm

Fractional Fourier transform(FRFT)as a Fourier transform of the generalized form is widely used in scientific computing and engineering research,and discrete Fourier transform(DFRFT)algorithm is the key for application.Eigendcomposition algorithm is based on the tridiagonal commuting matrix which provides sample approximations of the continuous Hermite-Gaussian like functions,and the DFRFT is interpreted as a weighting summation of Hermite-Gaussian functions.An improved algorithm is simulated.The simulation results show that the obtained Hermite-Gaussian function and continuous function approximation degree more excellent,so as to increase the discrete Fourier transform fractional order approximate degrees.