By Topic

Estimation of time-varying channels with orthogonal matching pursuit algorithm

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
$31 $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

2 Author(s)
Karabulut, G.Z. ; Sch. of Inf. Technol. & Eng., Ottawa Univ., Ont. ; Yongacoglu, A.

The adaptive matching pursuit (AMP) algorithm was proposed as a basis selection algorithm for time-varying dictionaries. We propose an adaptive orthogonal matching pursuit (AOMP) algorithm for estimation of time-varying channels with sparse impulse response samples. The performance of the AOMP algorithm is then compared with the AMP algorithm through mean squared identification error and by means of a decision feedback equalizer. It is shown, using simulation results, that the AOMP algorithm, by avoiding the re-selection problem that exists in the AMP algorithm, obtains more accurate channel estimates

Published in:

Advances in Wired and Wireless Communication, 2005 IEEE/Sarnoff Symposium on

Date of Conference:

18-19 April 2005