[Back]


Talks and Poster Presentations (with Proceedings-Entry):

M.-A. Badiu, G. Kirkelund, C. Manchon, E. Riegler, B. Fleury:
"Message-passing algorithms for channel estimation and decoding using approximate inference";
Talk: IEEE International Symposium on Information Theory (ISIT), Cambridge, MA; 07-01-2012 - 07-06-2012; in: "2012 IEEE International Symposium on Information Theory Proceedings", (2012), 5 pages.



English abstract:
Save to Project icon | Click to Close Quick AbstractQuick Abstract | PDF file iconPDF (174 KB)

We design iterative receiver schemes for a generic communication system by treating channel estimation and information decoding as an inference problem in graphical models. We introduce a recently proposed inference framework that combines belief propagation (BP) and the mean field (MF) approximation and includes these algorithms as special cases. We also show that the expectation propagation and expectation maximization (EM) algorithms can be embedded in the BP-MF framework with slight modifications. By applying the considered inference algorithms to our probabilistic model, we derive four different message-passing receiver schemes. Our numerical evaluation in a wireless scenario demonstrates that the receiver based on the BP-MF framework and its variant based on BP-EM yield the best compromise between performance, computational complexity and numerical stability among all candidate algorithms.

German abstract:
Save to Project icon | Click to Close Quick AbstractQuick Abstract | PDF file iconPDF (174 KB)

We design iterative receiver schemes for a generic communication system by treating channel estimation and information decoding as an inference problem in graphical models. We introduce a recently proposed inference framework that combines belief propagation (BP) and the mean field (MF) approximation and includes these algorithms as special cases. We also show that the expectation propagation and expectation maximization (EM) algorithms can be embedded in the BP-MF framework with slight modifications. By applying the considered inference algorithms to our probabilistic model, we derive four different message-passing receiver schemes. Our numerical evaluation in a wireless scenario demonstrates that the receiver based on the BP-MF framework and its variant based on BP-EM yield the best compromise between performance, computational complexity and numerical stability among all candidate algorithms.

Keywords:
Message passing, Free energy approximation, iterative algorithms


"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1109/ISIT.2012.6283939



Related Projects:
Project Head Erwin Herbert Riegler:
Nicht kohärente Übertragungsverfahren für Zeit-Frequenz selektive Mobilfunkkanäle


Created from the Publication Database of the Vienna University of Technology.