Hermite-Gaussian-like eigenvectors of the discrete Fourier transform matrix based on the direct utilization of the orthogonal projection matrices on its eigenspaces

Authors:
M.T. Hanna;N.P.A. Seif;W.A.E.M. Ahmed
Affiliations:
Dept. of Eng. Math. & Phys., Fayoum Univ.;-;-
Venue:
IEEE Transactions on Signal Processing
Year:
2006

Citing 0
Cited 5

Discrete fractional Fourier transform based on the eigenvectors of tridiagonal and nearly tridiagonal matrices

Digital Signal Processing
On discrete Gauss-Hermite functions and eigenvectors of the discrete Fourier transform

Signal Processing
Linear summation of fractional-order matrices

IEEE Transactions on Signal Processing
Direct sequential evaluation of optimal orthonormal eigenvectors of the discrete Fourier transform matrix by constrained optimization

Digital Signal Processing
Fractional discrete Fourier transform of type IV based on the eigenanalysis of a nearly tridiagonal matrix

Digital Signal Processing

Quantified Score

Hi-index	35.69

Visualization

Abstract

A new version is proposed for the Gram-Schmidt algorithm (GSA), the orthogonal procrustes algorithm (OPA) and the sequential orthogonal procrustes algorithm (SOPA) for generating Hermite-Gaussian-like orthonormal eigenvectors for the discrete Fourier transform matrix F. This version is based on the direct utilization of the orthogonal projection matrices on the eigenspaces of matrix F rather than the singular value decomposition of those matrices for the purpose of generating initial orthonormal eigenvectors. The proposed version of the algorithms has the merit of achieving a significant reduction in the computation time