English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper proposes a new detection algorithm for MIMO communication systemsemploying high order QAM constellations. The factor graph that corresponds tothis problem is very loopy; in fact, it is a complete graph. Hence, astraightforward application of the Belief Propagation (BP) algorithm yieldsvery poor results. Our algorithm is based on an optimal tree approximation ofthe Gaussian density of the unconstrained linear system. The finite-setconstraint is then applied to obtain a loop-free discrete distribution. It isshown that even though the approximation is not directly applied to the exactdiscrete distribution, applying the BP algorithm to the loop-free factor graphoutperforms current methods in terms of both performance and complexity. Theimproved performance of the proposed algorithm is demonstrated on the problemof MIMO detection.

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