Belief Propagation Based Multi–User Detection

We apply belief propagation (BP) to multi--user detection in a spread spectrum system, under the assumption of Gaussian symbols. We prove that BP is both convergent and allows to estimate the correct conditional expectation of the input symbols. It is therefore an optimal --minimum mean square error...

Full description

Saved in:
Bibliographic Details
Main Authors Montanari, Andrea, Prabhakar, Balaji, Tse, David
Format Journal Article
LanguageEnglish
Published 16.10.2005
Subjects
Computer Science - Information Theory
Mathematics - Information Theory
Online AccessGet full text
DOI10.48550/arxiv.cs/0510044

Cover

More Information
Summary:We apply belief propagation (BP) to multi--user detection in a spread spectrum system, under the assumption of Gaussian symbols. We prove that BP is both convergent and allows to estimate the correct conditional expectation of the input symbols. It is therefore an optimal --minimum mean square error-- detection algorithm. This suggests the possibility of designing BP detection algorithms for more general systems. As a byproduct we rederive the Tse-Hanly formula for minimum mean square error without any recourse to random matrix theory.
DOI:10.48550/arxiv.cs/0510044