2,845 research outputs found
Fundamental Limits in MIMO Broadcast Channels
This paper studies the fundamental limits of MIMO broadcast channels from a high level, determining the sum-rate capacity of the system as a function of system paramaters, such as the number of transmit antennas, the number of users, the number of receive antennas, and the total transmit power. The crucial role of channel state information at the transmitter is emphasized, as well as the emergence of opportunistic transmission schemes. The effects of channel estimation errors, training, and spatial correlation are studied, as well as issues related to fairness, delay and differentiated rate scheduling
Two-Layered Superposition of Broadcast/Multicast and Unicast Signals in Multiuser OFDMA Systems
We study optimal delivery strategies of one common and independent
messages from a source to multiple users in wireless environments. In
particular, two-layered superposition of broadcast/multicast and unicast
signals is considered in a downlink multiuser OFDMA system. In the literature
and industry, the two-layer superposition is often considered as a pragmatic
approach to make a compromise between the simple but suboptimal orthogonal
multiplexing (OM) and the optimal but complex fully-layered non-orthogonal
multiplexing. In this work, we show that only two-layers are necessary to
achieve the maximum sum-rate when the common message has higher priority than
the individual unicast messages, and OM cannot be sum-rate optimal in
general. We develop an algorithm that finds the optimal power allocation over
the two-layers and across the OFDMA radio resources in static channels and a
class of fading channels. Two main use-cases are considered: i) Multicast and
unicast multiplexing when users with uplink capabilities request both
common and independent messages, and ii) broadcast and unicast multiplexing
when the common message targets receive-only devices and users with uplink
capabilities additionally request independent messages. Finally, we develop a
transceiver design for broadcast/multicast and unicast superposition
transmission based on LTE-A-Pro physical layer and show with numerical
evaluations in mobile environments with multipath propagation that the capacity
improvements can be translated into significant practical performance gains
compared to the orthogonal schemes in the 3GPP specifications. We also analyze
the impact of real channel estimation and show that significant gains in terms
of spectral efficiency or coverage area are still available even with
estimation errors and imperfect interference cancellation for the two-layered
superposition system
Artificial Noise-Aided Biobjective Transmitter Optimization for Service Integration in Multi-User MIMO Gaussian Broadcast Channel
This paper considers an artificial noise (AN)-aided transmit design for
multi-user MIMO systems with integrated services. Specifically, two sorts of
service messages are combined and served simultaneously: one multicast message
intended for all receivers and one confidential message intended for only one
receiver and required to be perfectly secure from other unauthorized receivers.
Our interest lies in the joint design of input covariances of the multicast
message, confidential message and artificial noise (AN), such that the
achievable secrecy rate and multicast rate are simultaneously maximized. This
problem is identified as a secrecy rate region maximization (SRRM) problem in
the context of physical-layer service integration. Since this bi-objective
optimization problem is inherently complex to solve, we put forward two
different scalarization methods to convert it into a scalar optimization
problem. First, we propose to prefix the multicast rate as a constant, and
accordingly, the primal biobjective problem is converted into a secrecy rate
maximization (SRM) problem with quality of multicast service (QoMS) constraint.
By varying the constant, we can obtain different Pareto optimal points. The
resulting SRM problem can be iteratively solved via a provably convergent
difference-of-concave (DC) algorithm. In the second method, we aim to maximize
the weighted sum of the secrecy rate and the multicast rate. Through varying
the weighted vector, one can also obtain different Pareto optimal points. We
show that this weighted sum rate maximization (WSRM) problem can be recast into
a primal decomposable form, which is amenable to alternating optimization (AO).
Then we compare these two scalarization methods in terms of their overall
performance and computational complexity via theoretical analysis as well as
numerical simulation, based on which new insights can be drawn.Comment: 14 pages, 5 figure
- …