Graph representation for joint channel estimation and symbol detection

Sau-Hsuan Wu*, Urbashi Mitra, C. C Jay Kuo

*Corresponding author for this work

Research output: Contribution to conferencePaper

10 Scopus citations

Abstract

A unified structure is proposed for joint channel tracking and symbol detection in multipath fading channels. Based on the expectation maximization (EM) algorithm, a group of recursive stochastic filters is derived for blind channel estimation, using the maximum likelihood and minimum mean squared error criteria. In conjunction with the BCJR algorithm, it is shown that the recursive procedure for joint channel estimation and maximum a posteriori symbol detection can be represented as a message-passing scheme on a factor graph. The graphical model not only provides a generalized implementation architecture for existing training-based schemes, it also greatly reduces the complexity of existing algorithms for blind channel tracking.

Original languageEnglish
Pages2329-2333
Number of pages5
StatePublished - 1 Dec 2004
EventGLOBECOM'04 - IEEE Global Telecommunications Conference - Dallas, TX, United States
Duration: 29 Nov 20043 Dec 2004

Conference

ConferenceGLOBECOM'04 - IEEE Global Telecommunications Conference
CountryUnited States
CityDallas, TX
Period29/11/043/12/04

Fingerprint Dive into the research topics of 'Graph representation for joint channel estimation and symbol detection'. Together they form a unique fingerprint.

  • Cite this

    Wu, S-H., Mitra, U., & Kuo, C. C. J. (2004). Graph representation for joint channel estimation and symbol detection. 2329-2333. Paper presented at GLOBECOM'04 - IEEE Global Telecommunications Conference, Dallas, TX, United States.