Belief Propagation Based Multi--User Detection

2005/10/16 by Andrea Montanari, Montanari, Andrea, Balaji Prabhakar +3 · 2 citations
Computer Science · Mathematics · #Distributed Sensor Networks and Detection Algorithms #FOS: Computer and information sciences #Information Theory (cs.IT) #Random Matrices and Applications #Wireless Communication Networks Research #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.cs/0510044

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

openalex publication_date 2005/10/16 · arxiv created 2006/05/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Citations

• Life Above Threshold: From List Decoding to Area Theorem and MSE

Cited by

• Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application
• Fault Identification via Non-parametric Belief Propagation

Related

• Analysis of Belief Propagation for Non-Linear Problems: The Example of CDMA (or: How to Prove Tanaka's Formula)
• Optimization of the Belief-Propagation Algorithm for Distributed Detection by Linear Data-Fusion Techniques
• Probabilistic Receiver Architecture Combining BP, MF, and EP for\n Multi-Signal Detection
• Gaussian Belief Propagation: Theory and Aplication
• Relaxed Belief Propagation for MIMO Detection