234 research outputs found
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
Capacity-Achieving Iterative LMMSE Detection for MIMO-NOMA Systems
This paper considers a iterative Linear Minimum Mean Square Error (LMMSE)
detection for the uplink Multiuser Multiple-Input and Multiple-Output (MU-MIMO)
systems with Non-Orthogonal Multiple Access (NOMA). The iterative LMMSE
detection greatly reduces the system computational complexity by departing the
overall processing into many low-complexity distributed calculations. However,
it is generally considered to be sub-optimal and achieves relatively poor
performance. In this paper, we firstly present the matching conditions and area
theorems for the iterative detection of the MIMO-NOMA systems. Based on the
proposed matching conditions and area theorems, the achievable rate region of
the iterative LMMSE detection is analysed. We prove that by properly design the
iterative LMMSE detection, it can achieve (i) the optimal sum capacity of
MU-MIMO systems, (ii) all the maximal extreme points in the capacity region of
MU-MIMO system, and (iii) the whole capacity region of two-user MIMO systems.Comment: 6pages, 5 figures, accepted by IEEE ICC 2016, 23-27 May 2016, Kuala
Lumpur, Malaysi
Sparse Message Passing Based Preamble Estimation for Crowded M2M Communications
Due to the massive number of devices in the M2M communication era, new
challenges have been brought to the existing random-access (RA) mechanism, such
as severe preamble collisions and resource block (RB) wastes. To address these
problems, a novel sparse message passing (SMP) algorithm is proposed, based on
a factor graph on which Bernoulli messages are updated. The SMP enables an
accurate estimation on the activity of the devices and the identity of the
preamble chosen by each active device. Aided by the estimation, the RB
efficiency for the uplink data transmission can be improved, especially among
the collided devices. In addition, an analytical tool is derived to analyze the
iterative evolution and convergence of the SMP algorithm. Finally, numerical
simulations are provided to verify the validity of our analytical results and
the significant improvement of the proposed SMP on estimation error rate even
when preamble collision occurs.Comment: submitted to ICC 2018 with 6 pages and 4 figure
Capacity-Achieving MIMO-NOMA: Iterative LMMSE Detection
This paper considers a low-complexity iterative Linear Minimum Mean Square
Error (LMMSE) multi-user detector for the Multiple-Input and Multiple-Output
system with Non-Orthogonal Multiple Access (MIMO-NOMA), where multiple
single-antenna users simultaneously communicate with a multiple-antenna base
station (BS). While LMMSE being a linear detector has a low complexity, it has
suboptimal performance in multi-user detection scenario due to the mismatch
between LMMSE detection and multi-user decoding. Therefore, in this paper, we
provide the matching conditions between the detector and decoders for
MIMO-NOMA, which are then used to derive the achievable rate of the iterative
detection. We prove that a matched iterative LMMSE detector can achieve (i) the
optimal capacity of symmetric MIMO-NOMA with any number of users, (ii) the
optimal sum capacity of asymmetric MIMO-NOMA with any number of users, (iii)
all the maximal extreme points in the capacity region of asymmetric MIMO-NOMA
with any number of users, (iv) all points in the capacity region of two-user
and three-user asymmetric MIMO-NOMA systems. In addition, a kind of practical
low-complexity error-correcting multiuser code, called irregular
repeat-accumulate code, is designed to match the LMMSE detector. Numerical
results shows that the bit error rate performance of the proposed iterative
LMMSE detection outperforms the state-of-art methods and is within 0.8dB from
the associated capacity limit.Comment: Accepted by IEEE TSP, 16 pages, 9 figures. This is the first work
that proves the low-complexity iterative receiver (Parallel Interference
Cancellation) can achieve the capacity of multi-user MIMO systems. arXiv
admin note: text overlap with arXiv:1604.0831
Signal Processing and Learning for Next Generation Multiple Access in 6G
Wireless communication systems to date primarily rely on the orthogonality of
resources to facilitate the design and implementation, from user access to data
transmission. Emerging applications and scenarios in the sixth generation (6G)
wireless systems will require massive connectivity and transmission of a deluge
of data, which calls for more flexibility in the design concept that goes
beyond orthogonality. Furthermore, recent advances in signal processing and
learning have attracted considerable attention, as they provide promising
approaches to various complex and previously intractable problems of signal
processing in many fields. This article provides an overview of research
efforts to date in the field of signal processing and learning for
next-generation multiple access, with an emphasis on massive random access and
non-orthogonal multiple access. The promising interplay with new technologies
and the challenges in learning-based NGMA are discussed
Message Passing in C-RAN: Joint User Activity and Signal Detection
In cloud radio access network (C-RAN), remote radio heads (RRHs) and users
are uniformly distributed in a large area such that the channel matrix can be
considered as sparse. Based on this phenomenon, RRHs only need to detect the
relatively strong signals from nearby users and ignore the weak signals from
far users, which is helpful to develop low-complexity detection algorithms
without causing much performance loss. However, before detection, RRHs require
to obtain the realtime user activity information by the dynamic grant
procedure, which causes the enormous latency. To address this issue, in this
paper, we consider a grant-free C-RAN system and propose a low-complexity
Bernoulli-Gaussian message passing (BGMP) algorithm based on the sparsified
channel, which jointly detects the user activity and signal. Since active users
are assumed to transmit Gaussian signals at any time, the user activity can be
regarded as a Bernoulli variable and the signals from all users obey a
Bernoulli-Gaussian distribution. In the BGMP, the detection functions for
signals are designed with respect to the Bernoulli-Gaussian variable. Numerical
results demonstrate the robustness and effectivity of the BGMP. That is, for
different sparsified channels, the BGMP can approach the mean-square error
(MSE) of the genie-aided sparse minimum mean-square error (GA-SMMSE) which
exactly knows the user activity information. Meanwhile, the fast convergence
and strong recovery capability for user activity of the BGMP are also verified.Comment: Conference, 6 pages, 7 figures, accepted by IEEE Globecom 201
- …