DocumentCode
2695669
Title
Matching pursuit algorithm for Gaussian beam decomposition
Author
Arama, Amir ; Boag, Amir ; Heyman, Ehud
Author_Institution
Sch. of Electr. Eng., Tel Aviv Univ., Israel
fYear
2005
fDate
3-8 July 2005
Firstpage
272
Abstract
In this paper we have presented the MP algorithm as an alternative method for Gaussian beam decomposition. The results of the numerical example indicate that this type of WFT frame expansion produces a substantial improvement in the quality of the reconstructed field in terms of both the number of expansion coefficients and the relative error. However one major drawback of the MP algorithm is its computational complexity. Compared to the dual frame, the MP algorithm always appears to be time consuming.
Keywords
Fourier transforms; Gaussian distribution; electromagnetic wave propagation; iterative methods; time-frequency analysis; Gaussian beam decomposition; MP algorithm; WFT frame expansion; computational complexity; expansion coefficients; matching pursuit algorithm; reconstructed field; relative error; windowed Fourier transform; Apertures; Collimators; Fourier transforms; Hilbert space; Iterative algorithms; Lagrangian functions; Lattices; Matching pursuit algorithms; Pursuit algorithms; Skeleton;
fLanguage
English
Publisher
ieee
Conference_Titel
Antennas and Propagation Society International Symposium, 2005 IEEE
Print_ISBN
0-7803-8883-6
Type
conf
DOI
10.1109/APS.2005.1552798
Filename
1552798
Link To Document