MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation

Details MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation

2010-01-29

arxiv.org/abs/1001.5364v1

Computer Science

Information Theory

Scientific paper

This paper proposes a new detection algorithm for MIMO communication systems employing high order QAM constellations. The factor graph that corresponds to this problem is very loopy; in fact, it is a complete graph. Hence, a straightforward application of the Belief Propagation (BP) algorithm yields very poor results. Our algorithm is based on an optimal tree approximation of the Gaussian density of the unconstrained linear system. The finite-set constraint is then applied to obtain a loop-free discrete distribution. It is shown that even though the approximation is not directly applied to the exact discrete distribution, applying the BP algorithm to the loop-free factor graph outperforms current methods in terms of both performance and complexity. The improved performance of the proposed algorithm is demonstrated on the problem of MIMO detection.

Affiliated with

Also associated with

No associations

Rating

MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and MIMO Detection for High-Order QAM Based on a Gaussian Tree Approximation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676580