Eigenvectors of the Discrete Fourier Transform Based on the Bilinear Transform

Determining orthonormal eigenvectors of the DFT matrix, which is closer to the samples of Hermite-Gaussian functions, is crucial in the definition of the discrete fractional Fourier transform. In this work, we disclose eigenvectors of the DFT matrix inspired by the ideas behind bilinear transform. T...

Full description

Saved in:
Bibliographic Details
Published in:EURASIP journal on advances in signal processing 2010-01, Vol.2010 (1), Article 191085
Main Authors: Serbes, Ahmet, Durak-Ata (EURASIP Member), Lutfiye
Format: Article
Language:English
Subjects:
Applications of Time-Frequency Signal Processing in Wireless Communications and Bioengineering
Discretization
Eigenvectors
Engineering
Fourier transforms
Mathematical analysis
Matrices
Quantum Information Technology
Research Article
Signal,Image and Speech Processing
Simulation
Spintronics
Stability
Transforms
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Determining orthonormal eigenvectors of the DFT matrix, which is closer to the samples of Hermite-Gaussian functions, is crucial in the definition of the discrete fractional Fourier transform. In this work, we disclose eigenvectors of the DFT matrix inspired by the ideas behind bilinear transform. The bilinear transform maps the analog space to the discrete sample space. As j in the analog s -domain is mapped to the unit circle one-to-one without aliasing in the discrete z -domain, it is appropriate to use it in the discretization of the eigenfunctions of the Fourier transform. We obtain Hermite-Gaussian-like eigenvectors of the DFT matrix. For this purpose we propose three different methods and analyze their stability conditions. These methods include better conditioned commuting matrices and higher order methods. We confirm the results with extensive simulations.
ISSN:1687-6180
1687-6172
1687-6180
DOI:10.1155/2010/191085