912 research outputs found
Sum-Rate Maximization for Linearly Precoded Downlink Multiuser MISO Systems with Partial CSIT: A Rate-Splitting Approach
This paper considers the Sum-Rate (SR) maximization problem in downlink
MU-MISO systems under imperfect Channel State Information at the Transmitter
(CSIT). Contrary to existing works, we consider a rather unorthodox
transmission scheme. In particular, the message intended to one of the users is
split into two parts: a common part which can be recovered by all users, and a
private part recovered by the corresponding user. On the other hand, the rest
of users receive their information through private messages. This
Rate-Splitting (RS) approach was shown to boost the achievable Degrees of
Freedom (DoF) when CSIT errors decay with increased SNR. In this work, the RS
strategy is married with linear precoder design and optimization techniques to
achieve a maximized Ergodic SR (ESR) performance over the entire range of SNRs.
Precoders are designed based on partial CSIT knowledge by solving a stochastic
rate optimization problem using means of Sample Average Approximation (SAA)
coupled with the Weighted Minimum Mean Square Error (WMMSE) approach. Numerical
results show that in addition to the ESR gains, the benefits of RS also include
relaxed CSIT quality requirements and enhanced achievable rate regions compared
to conventional transmission with NoRS.Comment: accepted to IEEE Transactions on Communication
Decomposition by Successive Convex Approximation: A Unifying Approach for Linear Transceiver Design in Heterogeneous Networks
We study the downlink linear precoder design problem in a multi-cell dense
heterogeneous network (HetNet). The problem is formulated as a general
sum-utility maximization (SUM) problem, which includes as special cases many
practical precoder design problems such as multi-cell coordinated linear
precoding, full and partial per-cell coordinated multi-point transmission,
zero-forcing precoding and joint BS clustering and beamforming/precoding. The
SUM problem is difficult due to its non-convexity and the tight coupling of the
users' precoders. In this paper we propose a novel convex approximation
technique to approximate the original problem by a series of convex
subproblems, each of which decomposes across all the cells. The convexity of
the subproblems allows for efficient computation, while their decomposability
leads to distributed implementation. {Our approach hinges upon the
identification of certain key convexity properties of the sum-utility
objective, which allows us to transform the problem into a form that can be
solved using a popular algorithmic framework called BSUM (Block Successive
Upper-Bound Minimization).} Simulation experiments show that the proposed
framework is effective for solving interference management problems in large
HetNet.Comment: Accepted by IEEE Transactions on Wireless Communicatio
- …