By Topic

Maximum likelihood blind deconvolution for sparse systems

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)
Barembruch, S. ; Inst. des Telecommun., Telecom ParisTech, Paris, France ; Scaglione, A. ; Moulines, E.

In recent years many sparse estimation methods, also known as compressed sensing, have been developed for channel identification problems in digital communications. However, all these methods presume the transmitted sequence of symbols to be known at the receiver, i.e. in form of a training sequence. We consider blind identification of the channel based on maximum likelihood (ML) estimation via the EM algorithm incorporating a sparsity constraint in the maximization step. We apply this algorithm to a linear modulation scheme on a doubly-selective channel model.

Published in:

Cognitive Information Processing (CIP), 2010 2nd International Workshop on

Date of Conference:

14-16 June 2010