615 research outputs found
Cooperative Multi-Cell Block Diagonalization with Per-Base-Station Power Constraints
Block diagonalization (BD) is a practical linear precoding technique that
eliminates the inter-user interference in downlink multiuser multiple-input
multiple-output (MIMO) systems. In this paper, we apply BD to the downlink
transmission in a cooperative multi-cell MIMO system, where the signals from
different base stations (BSs) to all the mobile stations (MSs) are jointly
designed with the perfect knowledge of the downlink channels and transmit
messages. Specifically, we study the optimal BD precoder design to maximize the
weighted sum-rate of all the MSs subject to a set of per-BS power constraints.
This design problem is formulated in an auxiliary MIMO broadcast channel (BC)
with a set of transmit power constraints corresponding to those for individual
BSs in the multi-cell system. By applying convex optimization techniques, this
paper develops an efficient algorithm to solve this problem, and derives the
closed-form expression for the optimal BD precoding matrix. It is revealed that
the optimal BD precoding vectors for each MS in the per-BS power constraint
case are in general non-orthogonal, which differs from the conventional
orthogonal BD precoder design for the MIMO-BC under one single sum-power
constraint. Moreover, for the special case of single-antenna BSs and MSs, the
proposed solution reduces to the optimal zero-forcing beamforming (ZF-BF)
precoder design for the weighted sum-rate maximization in the multiple-input
single-output (MISO) BC with per-antenna power constraints. Suboptimal and
low-complexity BD/ZF-BF precoding schemes are also presented, and their
achievable rates are compared against those with the optimal schemes.Comment: accepted in JSAC, special issue on cooperative communications on
cellular networks, June 201
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
Optimality Properties, Distributed Strategies, and Measurement-Based Evaluation of Coordinated Multicell OFDMA Transmission
The throughput of multicell systems is inherently limited by interference and
the available communication resources. Coordinated resource allocation is the
key to efficient performance, but the demand on backhaul signaling and
computational resources grows rapidly with number of cells, terminals, and
subcarriers. To handle this, we propose a novel multicell framework with
dynamic cooperation clusters where each terminal is jointly served by a small
set of base stations. Each base station coordinates interference to neighboring
terminals only, thus limiting backhaul signalling and making the framework
scalable. This framework can describe anything from interference channels to
ideal joint multicell transmission.
The resource allocation (i.e., precoding and scheduling) is formulated as an
optimization problem (P1) with performance described by arbitrary monotonic
functions of the signal-to-interference-and-noise ratios (SINRs) and arbitrary
linear power constraints. Although (P1) is non-convex and difficult to solve
optimally, we are able to prove: 1) Optimality of single-stream beamforming; 2)
Conditions for full power usage; and 3) A precoding parametrization based on a
few parameters between zero and one. These optimality properties are used to
propose low-complexity strategies: both a centralized scheme and a distributed
version that only requires local channel knowledge and processing. We evaluate
the performance on measured multicell channels and observe that the proposed
strategies achieve close-to-optimal performance among centralized and
distributed solutions, respectively. In addition, we show that multicell
interference coordination can give substantial improvements in sum performance,
but that joint transmission is very sensitive to synchronization errors and
that some terminals can experience performance degradations.Comment: Published in IEEE Transactions on Signal Processing, 15 pages, 7
figures. This version corrects typos related to Eq. (4) and Eq. (28
Machine Learning-Enabled Joint Antenna Selection and Precoding Design: From Offline Complexity to Online Performance
We investigate the performance of multi-user multiple-antenna downlink
systems in which a BS serves multiple users via a shared wireless medium. In
order to fully exploit the spatial diversity while minimizing the passive
energy consumed by radio frequency (RF) components, the BS is equipped with M
RF chains and N antennas, where M < N. Upon receiving pilot sequences to obtain
the channel state information, the BS determines the best subset of M antennas
for serving the users. We propose a joint antenna selection and precoding
design (JASPD) algorithm to maximize the system sum rate subject to a transmit
power constraint and QoS requirements. The JASPD overcomes the non-convexity of
the formulated problem via a doubly iterative algorithm, in which an inner loop
successively optimizes the precoding vectors, followed by an outer loop that
tries all valid antenna subsets. Although approaching the (near) global
optimality, the JASPD suffers from a combinatorial complexity, which may limit
its application in real-time network operations. To overcome this limitation,
we propose a learning-based antenna selection and precoding design algorithm
(L-ASPA), which employs a DNN to establish underlaying relations between the
key system parameters and the selected antennas. The proposed L-ASPD is robust
against the number of users and their locations, BS's transmit power, as well
as the small-scale channel fading. With a well-trained learning model, it is
shown that the L-ASPD significantly outperforms baseline schemes based on the
block diagonalization and a learning-assisted solution for broadcasting systems
and achieves higher effective sum rate than that of the JASPA under limited
processing time. In addition, we observed that the proposed L-ASPD can reduce
the computation complexity by 95% while retaining more than 95% of the optimal
performance.Comment: accepted to the IEEE Transactions on Wireless Communication
- …