Low-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models

Abstract

In this paper, we deal with low-complexity near-optimal detection/equalization in large-dimension multiple-input multiple-output inter-symbol interference (MIMO-ISI) channels using message passing on graphical models. A key contribution in the paper is the demonstration that near-optimal performance in MIMO-ISI channels with large dimensions can be achieved at low complexities through simple yet effective simplifications/approximations, although the graphical models that represent MIMO-ISI channels are fully/densely connected (loopy graphs). These include 1) use of Markov Random Field (MRF) based graphical model with pairwise interaction, in conjunction with {\em message/belief damping}, and 2) use of Factor Graph (FG) based graphical model with {\em Gaussian approximation of interference} (GAI). The per-symbol complexities are $O(K^2{n}_t^2)$ and $O(K{n}_t)$ for the MRF and the FG with GAI approaches, respectively, where $K$ and $n_t$ denote the number of channel uses per frame, and number of transmit antennas, respectively. These low-complexities are quite attractive for large dimensions, i.e., for large $K{n}_t$. From a performance perspective, these algorithms are even more interesting in large-dimensions since they achieve increasingly closer to optimum detection performance for increasing $K{n}_t$. Also, we show that these message passing algorithms can be used in an iterative manner with local neighborhood search algorithms to improve the reliability/performance of $M$-QAM symbol detection.

References in corpus (6)

• Loopy Belief Propagation for Approximate Inference: An Empirical Study
• Sufficient conditions for convergence of the Sum-Product Algorithm
• High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Channel Estimation
• Approximate Inference and Constrained Optimization
• Belief Propagation Based Multi--User Detection
• Improved message passing for inference in densely connected systems

Cited by in corpus (14)

• Fifty Years of MIMO Detection: The Road to Large-Scale MIMOs
• Interference Cancellation and Iterative Detection for Orthogonal Time Frequency Space Modulation
• A Message Passing Detection based Affine Frequency Division Multiplexing Communication System
• Low-Complexity Iterative Detection for Orthogonal Time Frequency Space Modulation
• Unifying Message Passing Algorithms Under the Framework of Constrained Bethe Free Energy Minimization
• A Low-Complexity Graph-Based LMMSE Receiver for MIMO ISI Channels with M-QAM Modulation
• Distributed Receivers for Extra-Large Scale MIMO Arrays: A Message Passing Approach
• A Novel MCMC Based Receiver for Large-Scale Uplink Multiuser MIMO Systems
• Receiver Design for OTFS with Fractionally Spaced Sampling Approach
• Message-Passing Receiver for Joint Channel Estimation and Decoding in 3D Massive MIMO-OFDM Systems
• Deterministic Sampling Decoding: Where Sphere Decoding Meets Lattice Gaussian Distribution
• SUMIS: Near-Optimal Soft-In Soft-Out MIMO Detection With Low and Fixed Complexity
• M-ary Detection and q-ary Decoding in Large-Scale MIMO: A Non-Binary Belief Propagation Approach
• Lowering the error floor of Gallager codes: a statistical-mechanical view