2,290 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
Robust Transmission in Downlink Multiuser MISO Systems: A Rate-Splitting Approach
We consider a downlink multiuser MISO system with bounded errors in the
Channel State Information at the Transmitter (CSIT). We first look at the
robust design problem of achieving max-min fairness amongst users (in the
worst-case sense). Contrary to the conventional approach adopted in literature,
we propose a rather unorthodox design based on a Rate-Splitting (RS) strategy.
Each user's message is split into two parts, a common part and a private part.
All common parts are packed into one super common message encoded using a
public codebook, while private parts are independently encoded. The resulting
symbol streams are linearly precoded and simultaneously transmitted, and each
receiver retrieves its intended message by decoding both the common stream and
its corresponding private stream. For CSIT uncertainty regions that scale with
SNR (e.g. by scaling the number of feedback bits), we prove that a RS-based
design achieves higher max-min (symmetric) Degrees of Freedom (DoF) compared to
conventional designs (NoRS). For the special case of non-scaling CSIT (e.g.
fixed number of feedback bits), and contrary to NoRS, RS can achieve a
non-saturating max-min rate. We propose a robust algorithm based on the
cutting-set method coupled with the Weighted Minimum Mean Square Error (WMMSE)
approach, and we demonstrate its performance gains over state-of-the art
designs. Finally, we extend the RS strategy to address the Quality of Service
(QoS) constrained power minimization problem, and we demonstrate significant
gains over NoRS-based designs.Comment: Accepted for publication in IEEE Transactions on Signal Processin
Outage Constrained Robust Secure Transmission for MISO Wiretap Channels
In this paper we consider the robust secure beamformer design for MISO
wiretap channels. Assume that the eavesdroppers' channels are only partially
available at the transmitter, we seek to maximize the secrecy rate under the
transmit power and secrecy rate outage probability constraint. The outage
probability constraint requires that the secrecy rate exceeds certain threshold
with high probability. Therefore including such constraint in the design
naturally ensures the desired robustness. Unfortunately, the presence of the
probabilistic constraints makes the problem non-convex and hence difficult to
solve. In this paper, we investigate the outage probability constrained secrecy
rate maximization problem using a novel two-step approach. Under a wide range
of uncertainty models, our developed algorithms can obtain high-quality
solutions, sometimes even exact global solutions, for the robust secure
beamformer design problem. Simulation results are presented to verify the
effectiveness and robustness of the proposed algorithms
Optimization of Training and Feedback Overhead for Beamforming over Block Fading Channels
We examine the capacity of beamforming over a single-user, multi-antenna link
taking into account the overhead due to channel estimation and limited feedback
of channel state information. Multi-input single-output (MISO) and multi-input
multi-output (MIMO) channels are considered subject to block Rayleigh fading.
Each coherence block contains symbols, and is spanned by training
symbols, feedback bits, and the data symbols. The training symbols are used
to obtain a Minimum Mean Squared Error estimate of the channel matrix. Given
this estimate, the receiver selects a transmit beamforming vector from a
codebook containing {\em i.i.d.} random vectors, and sends the
corresponding bits back to the transmitter. We derive bounds on the
beamforming capacity for MISO and MIMO channels and characterize the optimal
(rate-maximizing) training and feedback overhead ( and ) as and the
number of transmit antennas both become large. The optimal is
limited by the coherence time, and increases as . For the MISO
channel the optimal and (fractional overhead due to training and
feedback) are asymptotically the same, and tend to zero at the rate . For the MIMO channel the optimal feedback overhead tends to zero
faster (as ).Comment: accepted for IEEE Trans. Info. Theory, 201
- …