86 research outputs found
Pareto Characterization of the Multicell MIMO Performance Region With Simple Receivers
We study the performance region of a general multicell downlink scenario with
multiantenna transmitters, hardware impairments, and low-complexity receivers
that treat interference as noise. The Pareto boundary of this region describes
all efficient resource allocations, but is generally hard to compute. We
propose a novel explicit characterization that gives Pareto optimal transmit
strategies using a set of positive parameters---fewer than in prior work. We
also propose an implicit characterization that requires even fewer parameters
and guarantees to find the Pareto boundary for every choice of parameters, but
at the expense of solving quasi-convex optimization problems. The merits of the
two characterizations are illustrated for interference channels and ideal
network multiple-input multiple-output (MIMO).Comment: Published in IEEE Transactions on Signal Processing, 6 pages, 6
figure
Coordinated Beamforming with Relaxed Zero Forcing: The Sequential Orthogonal Projection Combining Method and Rate Control
In this paper, coordinated beamforming based on relaxed zero forcing (RZF)
for K transmitter-receiver pair multiple-input single-output (MISO) and
multiple-input multiple-output (MIMO) interference channels is considered. In
the RZF coordinated beamforming, conventional zero-forcing interference leakage
constraints are relaxed so that some predetermined interference leakage to
undesired receivers is allowed in order to increase the beam design space for
larger rates than those of the zero-forcing (ZF) scheme or to make beam design
feasible when ZF is impossible. In the MISO case, it is shown that the
rate-maximizing beam vector under the RZF framework for a given set of
interference leakage levels can be obtained by sequential orthogonal projection
combining (SOPC). Based on this, exact and approximate closed-form solutions
are provided in two-user and three-user cases, respectively, and an efficient
beam design algorithm for RZF coordinated beamforming is provided in general
cases. Furthermore, the rate control problem under the RZF framework is
considered. A centralized approach and a distributed heuristic approach are
proposed to control the position of the designed rate-tuple in the achievable
rate region. Finally, the RZF framework is extended to MIMO interference
channels by deriving a new lower bound on the rate of each user.Comment: Lemma 1 proof corrected; a new SOPC algorithm invented; K > N case
considere
Distributed Multicell Beamforming Design Approaching Pareto Boundary with Max-Min Fairness
This paper addresses coordinated downlink beamforming optimization in
multicell time-division duplex (TDD) systems where a small number of parameters
are exchanged between cells but with no data sharing. With the goal to reach
the point on the Pareto boundary with max-min rate fairness, we first develop a
two-step centralized optimization algorithm to design the joint beamforming
vectors. This algorithm can achieve a further sum-rate improvement over the
max-min optimal performance, and is shown to guarantee max-min Pareto
optimality for scenarios with two base stations (BSs) each serving a single
user. To realize a distributed solution with limited intercell communication,
we then propose an iterative algorithm by exploiting an approximate
uplink-downlink duality, in which only a small number of positive scalars are
shared between cells in each iteration. Simulation results show that the
proposed distributed solution achieves a fairness rate performance close to the
centralized algorithm while it has a better sum-rate performance, and
demonstrates a better tradeoff between sum-rate and fairness than the Nash
Bargaining solution especially at high signal-to-noise ratio.Comment: 8 figures. To Appear in IEEE Trans. Wireless Communications, 201
Transmit Optimization with Improper Gaussian Signaling for Interference Channels
This paper studies the achievable rates of Gaussian interference channels
with additive white Gaussian noise (AWGN), when improper or circularly
asymmetric complex Gaussian signaling is applied. For the Gaussian
multiple-input multiple-output interference channel (MIMO-IC) with the
interference treated as Gaussian noise, we show that the user's achievable rate
can be expressed as a summation of the rate achievable by the conventional
proper or circularly symmetric complex Gaussian signaling in terms of the
users' transmit covariance matrices, and an additional term, which is a
function of both the users' transmit covariance and pseudo-covariance matrices.
The additional degrees of freedom in the pseudo-covariance matrix, which is
conventionally set to be zero for the case of proper Gaussian signaling,
provide an opportunity to further improve the achievable rates of Gaussian
MIMO-ICs by employing improper Gaussian signaling. To this end, this paper
proposes widely linear precoding, which efficiently maps proper
information-bearing signals to improper transmitted signals at each transmitter
for any given pair of transmit covariance and pseudo-covariance matrices. In
particular, for the case of two-user Gaussian single-input single-output
interference channel (SISO-IC), we propose a joint covariance and
pseudo-covariance optimization algorithm with improper Gaussian signaling to
achieve the Pareto-optimal rates. By utilizing the separable structure of the
achievable rate expression, an alternative algorithm with separate covariance
and pseudo-covariance optimization is also proposed, which guarantees the rate
improvement over conventional proper Gaussian signaling.Comment: Accepted by IEEE Transactions on Signal Processin
Robust Monotonic Optimization Framework for Multicell MISO Systems
The performance of multiuser systems is both difficult to measure fairly and
to optimize. Most resource allocation problems are non-convex and NP-hard, even
under simplifying assumptions such as perfect channel knowledge, homogeneous
channel properties among users, and simple power constraints. We establish a
general optimization framework that systematically solves these problems to
global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles
general multicell downlink systems with single-antenna users, multiantenna
transmitters, arbitrary quadratic power constraints, and robustness to channel
uncertainty. A robust fairness-profile optimization (RFO) problem is solved at
each iteration, which is a quasi-convex problem and a novel generalization of
max-min fairness. The BRB algorithm is computationally costly, but it shows
better convergence than the previously proposed outer polyblock approximation
algorithm. Our framework is suitable for computing benchmarks in general
multicell systems with or without channel uncertainty. We illustrate this by
deriving and evaluating a zero-forcing solution to the general problem.Comment: Published in IEEE Transactions on Signal Processing, 16 pages, 9
figures, 2 table
- …