963 research outputs found
Low-Complexity Detection/Equalization in Large-Dimension MIMO-ISI Channels Using Graphical Models
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 and
for the MRF and the FG with GAI approaches, respectively, where
and 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 . From a performance perspective, these
algorithms are even more interesting in large-dimensions since they achieve
increasingly closer to optimum detection performance for increasing .
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 -QAM symbol detection
Gaussian Message Passing for Overloaded Massive MIMO-NOMA
This paper considers a low-complexity Gaussian Message Passing (GMP) scheme
for a coded massive Multiple-Input Multiple-Output (MIMO) systems with
Non-Orthogonal Multiple Access (massive MIMO-NOMA), in which a base station
with antennas serves sources simultaneously in the same frequency.
Both and are large numbers, and we consider the overloaded cases
with . The GMP for MIMO-NOMA is a message passing algorithm operating
on a fully-connected loopy factor graph, which is well understood to fail to
converge due to the correlation problem. In this paper, we utilize the
large-scale property of the system to simplify the convergence analysis of the
GMP under the overloaded condition. First, we prove that the \emph{variances}
of the GMP definitely converge to the mean square error (MSE) of Linear Minimum
Mean Square Error (LMMSE) multi-user detection. Secondly, the \emph{means} of
the traditional GMP will fail to converge when . Therefore, we propose and derive a new
convergent GMP called scale-and-add GMP (SA-GMP), which always converges to the
LMMSE multi-user detection performance for any , and show that it
has a faster convergence speed than the traditional GMP with the same
complexity. Finally, numerical results are provided to verify the validity and
accuracy of the theoretical results presented.Comment: Accepted by IEEE TWC, 16 pages, 11 figure
Channel Hardening-Exploiting Message Passing (CHEMP) Receiver in Large-Scale MIMO Systems
In this paper, we propose a MIMO receiver algorithm that exploits {\em
channel hardening} that occurs in large MIMO channels. Channel hardening refers
to the phenomenon where the off-diagonal terms of the matrix
become increasingly weaker compared to the diagonal terms as the size of the
channel gain matrix increases. Specifically, we propose a message
passing detection (MPD) algorithm which works with the real-valued matched
filtered received vector (whose signal term becomes ,
where is the transmitted vector), and uses a Gaussian approximation
on the off-diagonal terms of the matrix. We also propose a
simple estimation scheme which directly obtains an estimate of (instead of an estimate of ), which is used as an effective
channel estimate in the MPD algorithm. We refer to this receiver as the {\em
channel hardening-exploiting message passing (CHEMP)} receiver. The proposed
CHEMP receiver achieves very good performance in large-scale MIMO systems
(e.g., in systems with 16 to 128 uplink users and 128 base station antennas).
For the considered large MIMO settings, the complexity of the proposed MPD
algorithm is almost the same as or less than that of the minimum mean square
error (MMSE) detection. This is because the MPD algorithm does not need a
matrix inversion. It also achieves a significantly better performance compared
to MMSE and other message passing detection algorithms using MMSE estimate of
. We also present a convergence analysis of the proposed MPD
algorithm. Further, we design optimized irregular low density parity check
(LDPC) codes specific to the considered large MIMO channel and the CHEMP
receiver through EXIT chart matching. The LDPC codes thus obtained achieve
improved coded bit error rate performance compared to off-the-shelf irregular
LDPC codes
- β¦