Maximum likelihood blind deconvolution for sparse systems

Steffen Barembruch, Anna Scaglione, Eric Moulines

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish (US)
Title of host publication2010 2nd International Workshop on Cognitive Information Processing, CIP2010
Pages69-74
Number of pages6
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 2nd International Workshop on Cognitive Information Processing, CIP2010 - Elba Island, Italy
Duration: Jun 14 2010Jun 16 2010

Other

Other2010 2nd International Workshop on Cognitive Information Processing, CIP2010
CountryItaly
CityElba Island
Period6/14/106/16/10

Fingerprint

Deconvolution
Maximum likelihood
Compressed sensing
Maximum likelihood estimation
Modulation
Communication

Keywords

  • Compressive Sensing
  • Deconvolution
  • Multipath channels
  • Smoothing methods

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems

Cite this

Barembruch, S., Scaglione, A., & Moulines, E. (2010). Maximum likelihood blind deconvolution for sparse systems. In 2010 2nd International Workshop on Cognitive Information Processing, CIP2010 (pp. 69-74). [5604139] https://doi.org/10.1109/CIP.2010.5604139

Maximum likelihood blind deconvolution for sparse systems. / Barembruch, Steffen; Scaglione, Anna; Moulines, Eric.

2010 2nd International Workshop on Cognitive Information Processing, CIP2010. 2010. p. 69-74 5604139.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Barembruch, S, Scaglione, A & Moulines, E 2010, Maximum likelihood blind deconvolution for sparse systems. in 2010 2nd International Workshop on Cognitive Information Processing, CIP2010., 5604139, pp. 69-74, 2010 2nd International Workshop on Cognitive Information Processing, CIP2010, Elba Island, Italy, 6/14/10. https://doi.org/10.1109/CIP.2010.5604139
Barembruch S, Scaglione A, Moulines E. Maximum likelihood blind deconvolution for sparse systems. In 2010 2nd International Workshop on Cognitive Information Processing, CIP2010. 2010. p. 69-74. 5604139 https://doi.org/10.1109/CIP.2010.5604139
Barembruch, Steffen ; Scaglione, Anna ; Moulines, Eric. / Maximum likelihood blind deconvolution for sparse systems. 2010 2nd International Workshop on Cognitive Information Processing, CIP2010. 2010. pp. 69-74
@inproceedings{5f0430e3b7204bfda3ca6aa452ccfaf0,
title = "Maximum likelihood blind deconvolution for sparse systems",
abstract = "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.",
keywords = "Compressive Sensing, Deconvolution, Multipath channels, Smoothing methods",
author = "Steffen Barembruch and Anna Scaglione and Eric Moulines",
year = "2010",
doi = "10.1109/CIP.2010.5604139",
language = "English (US)",
isbn = "9781424464593",
pages = "69--74",
booktitle = "2010 2nd International Workshop on Cognitive Information Processing, CIP2010",

}

TY - GEN

T1 - Maximum likelihood blind deconvolution for sparse systems

AU - Barembruch, Steffen

AU - Scaglione, Anna

AU - Moulines, Eric

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Compressive Sensing

KW - Deconvolution

KW - Multipath channels

KW - Smoothing methods

UR - http://www.scopus.com/inward/record.url?scp=78349299845&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78349299845&partnerID=8YFLogxK

U2 - 10.1109/CIP.2010.5604139

DO - 10.1109/CIP.2010.5604139

M3 - Conference contribution

AN - SCOPUS:78349299845

SN - 9781424464593

SP - 69

EP - 74

BT - 2010 2nd International Workshop on Cognitive Information Processing, CIP2010

ER -