By Topic

Matching pursuit based sparse channel estimation using Pseudorandom Sequences

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

3 Author(s)
Sun Teng ; 54th Res. Inst., CETC, Shijiazhuang, China ; Song zhiqun ; Zhang Yongjie

In this paper, estimation of channels with large delay spread but with few nonzero taps, such as those encountered in hilly broadcast wireless communications, are considered. Exploiting the sparsity, a channel estimate can be obtained by using a matching pursuit (MP) algorithm. To improve the performance of MP algorithm based estimation, the orthogonal matching pursuit (OMP) algorithm for channel estimation is proposed. In OMP, the re-selection problem of MP algorithm is avoided by using the stored dictionary at each iteration, and faster convergence to a sparse solution is obtained. we proposed to use MP algorithm based on Pseudorandom Sequences for training sequences for channel estimation. Using the proposed method, the main taps distorted by the projection of other taps is eliminated by the dictionary with orthogonal property, and more accurate channel estimates can be obtained. The results of channel estimates by using MP, OMP and the proposed method are compared, verifying that the proposed method outperforms the MP and OMP methods, with the same computational complexity as MP algorithm.

Published in:

Millimeter Waves (GSMM), 2012 5th Global Symposium on

Date of Conference:

27-30 May 2012