By Topic

Compressed sensing Block MAP-LMS adaptive filter for sparse channel estimation and a Bayesian Cramer-Rao bound

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)
Zayyani, H. ; Dept. of Electr. Eng. & Adv. Commun., Sharif Univ. of Technol., Tehran, Iran ; Babaie-Zadeh, M. ; Jutten, C.

This paper suggests to use a block MAP-LMS (BMAP-LMS) adaptive filter instead of an adaptive filter called MAP-LMS for estimating the sparse channels. Moreover to faster convergence than MAP-LMS, this block-based adaptive filter enables us to use a compressed sensing version of it which exploits the sparsity of the channel outputs to reduce the sampling rate of the received signal and to alleviate the complexity of the BMAP-LMS. Our simulations show that our proposed algorithm has faster convergence and less final MSE than MAP-LMS, while it is more complex than MAP-LMS. Moreover, some lower bounds for sparse channel estimation is discussed. Specially, a Cramer-Rao bound and a Bayesian Cramer-Rao bound is also calculated.

Published in:

Machine Learning for Signal Processing, 2009. MLSP 2009. IEEE International Workshop on

Date of Conference:

1-4 Sept. 2009