Belief Propagation Based Multi--User Detection

Abstract

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.

9 pages, 4 eps figures. Forty-third Allerton Conference on Communications, Control and Computing, invited paper

Cited by in corpus (8)

• Low-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models
• Belief-Propagation for Weighted b-Matchings on Arbitrary Graphs and its Relation to Linear Programs with Integer Solutions
• Structure-Based Bayesian Sparse Reconstruction
• A Low-Complexity Gaussian Message Passing Iterative Detector for Massive MU-MIMO Systems
• The Noise-Sensitivity Phase Transition in Compressed Sensing
• Fault Identification via Non-parametric Belief Propagation
• Convergence and Density Evolution of a Low-Complexity MIMO Detector based on Forward-Backward Recursion over a Ring
• Gaussian Message Passing for Overloaded Massive MIMO-NOMA