Spectral methods in MatLab
Discrete Fractional Fourier Transform Based on New Nearly Tridiagonal Commuting Matrices
IEEE Transactions on Signal Processing
The discrete rotational Fourier transform
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing - Part II
The discrete fractional Fourier transform
IEEE Transactions on Signal Processing
Linear summation of fractional-order matrices
IEEE Transactions on Signal Processing
Eigenvectors of the discrete Fourier transform based on the bilinear transform
EURASIP Journal on Advances in Signal Processing - Special issue on applications of time-frequency signal processing in wireless communications and bioengineering
Hi-index | 35.69 |
Recently, Candan introduced higher order DFT-commuting matrices whose eigenvectors are better approximations to the continuous Hermite-Gaussian functions (HGFs). However, the highest order 2k of the O(h2k) N × N DFT-commuting matrices proposed by Candan is restricted by 2k + 1 ≤ N. In this paper, we remove this order upper bound restriction by developing two methods to construct arbitrary-order DFT-commuting matrices. Computer experimental results show that the Hermite-Gaussian-like (HGL) eigenvectors of the new proposed DFT -commuting matrices outperform those of Candan. In addition, the HGL eigenvectors of the mfinite-order DFT -commuting matrix are shown to be the same as those of the n2 DFT -commuting matrix recently discovered in the literature.