DocumentCode
3525006
Title
Generating matrix of discrete Fourier transform eigenvectors
Author
Pei, Soo-Chang ; Chang, Kuo-Wei
Author_Institution
Dept. of Electr. Eng., Nat. Taiwan Univ., Taipei
fYear
2009
fDate
19-24 April 2009
Firstpage
3333
Lastpage
3336
Abstract
This paper provides a novel method to obtain the eigenvectors of discrete Fourier transform (DFT), which are accurate approximations to the continuous Hermite-Gaussian functions (HGFs). The proposed method uses a generating matrix and an initial eigenvector. By multiplying the initial eigenvector with the generating matrix, we can derive a new eigenvector. Repeating this procedure we can acquire all the eigenvectors. Compare with the conventional O(N3) commutative matrix method, this new method can generate all the DFT eigenvectors with complexity reduced to O(N2logN). The generating matrix can be further used to intensify the conventional commuting matrix. The simulation result shows that the Hermite-Gaussian like (HGL) eigenvectors of the strengthened commuting matrix outperform those of Santhanam´s.
Keywords
Gaussian processes; Hermitian matrices; computational complexity; discrete Fourier transforms; eigenvalues and eigenfunctions; matrix multiplication; Hermite Gaussian function; conventional commuting matrix; discrete Fourier transform; eigenvector; matrix generation; matrix multiplication; Cryptography; Discrete Fourier transforms; Eigenvalues and eigenfunctions; Filtering; Fourier transforms; Karhunen-Loeve transforms; Radar applications; Radar signal processing; Discrete Fourier transform; Hermite-Gauss functions; eigenvector;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on
Conference_Location
Taipei
ISSN
1520-6149
Print_ISBN
978-1-4244-2353-8
Electronic_ISBN
1520-6149
Type
conf
DOI
10.1109/ICASSP.2009.4960338
Filename
4960338
Link To Document