By Topic

Applications of Basis Selection Algorithms in Communication Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. Z. Karabulut ; School of Information Technology and Engineering, University of Ottawa, K1N 6N5, Ontario, Canada, ; T. Kurt ; A. Yongacoglu

In this paper, we study the application of sequential basis selection (SBS) algorithms in two different communication problems. These problems represent different cases in terms of the structure of their set of equations. The two considered cases are; undercomplete set of equations (sparse channel estimation problem) and overcomplete set of equations. These cases are carefully selected in order to demonstrate that SBS algorithms can be applied to both types of equations. The basic matching pursuit (BMP) and the orthogonal matching pursuit (OMP) algorithms are selected as the SBS algorithms. In sparse channel estimation problem, the BMP and the OMP algorithms are compared with the least square channel estimates and the minimum variance unbiased estimates (MVUE). It is shown that the OMP algorithm gives estimates that are almost converging to MVUE. In angle of arrival (AOA) detection problem, the detection performances of the BMP and OMP algorithms are compared with the well known MUSIC algorithm and the Cramer Rao bounds. It is shown that their performances exceed that of MUSIC for correlated signals

Published in:

2006 IEEE 14th Signal Processing and Communications Applications

Date of Conference:

17-19 April 2006