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

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

An Analytical Framework for Heterogeneous Partial Feedback Design in Heterogeneous Multicell OFDMA Networks

The inherent heterogeneous structure resulting from user densities and large scale channel effects motivates heterogeneous partial feedback design in heterogeneous networks. In such emerging networks, a distributed scheduling policy which enjoys multiuser diversity as well as maintains fairness among users is favored for individual user rate enhancement and guarantees. For a system employing the cumulative distribution function based scheduling, which satisfies the two above mentioned desired features, we develop an analytical framework to investigate heterogeneous partial feedback in a general OFDMA-based heterogeneous multicell employing the best-M partial feedback strategy. Exact sum rate analysis is first carried out and closed form expressions are obtained by a novel decomposition of the probability density function of the selected user's signal-to-interference-plus-noise ratio. To draw further insight, we perform asymptotic analysis using extreme value theory to examine the effect of partial feedback on the randomness of multiuser diversity, show the asymptotic optimality of best-1 feedback, and derive an asymptotic approximation for the sum rate in order to determine the minimum required partial feedback.Comment: To appear in IEEE Trans. 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

Multicell Coordinated Beamforming with Rate Outage Constraint--Part I: Complexity Analysis

This paper studies the coordinated beamforming (CoBF) design in the multiple-input single-output interference channel, assuming only channel distribution information given a priori at the transmitters. The CoBF design is formulated as an optimization problem that maximizes a predefined system utility, e.g., the weighted sum rate or the weighted max-min-fairness (MMF) rate, subject to constraints on the individual probability of rate outage and power budget. While the problem is non-convex and appears difficult to handle due to the intricate outage probability constraints, so far it is still unknown if this outage constrained problem is computationally tractable. To answer this, we conduct computational complexity analysis of the outage constrained CoBF problem. Specifically, we show that the outage constrained CoBF problem with the weighted sum rate utility is intrinsically difficult, i.e., NP-hard. Moreover, the outage constrained CoBF problem with the weighted MMF rate utility is also NP-hard except the case when all the transmitters are equipped with single antenna. The presented analysis results confirm that efficient approximation methods are indispensable to the outage constrained CoBF problem.Comment: submitted to IEEE Transactions on Signal Processin

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

Massive MIMO and Small Cells: Improving Energy Efficiency by Optimal Soft-Cell Coordination

To improve the cellular energy efficiency, without sacrificing quality-of-service (QoS) at the users, the network topology must be densified to enable higher spatial reuse. We analyze a combination of two densification approaches, namely "massive" multiple-input multiple-output (MIMO) base stations and small-cell access points. If the latter are operator-deployed, a spatial soft-cell approach can be taken where the multiple transmitters serve the users by joint non-coherent multiflow beamforming. We minimize the total power consumption (both dynamic emitted power and static hardware power) while satisfying QoS constraints. This problem is proved to have a hidden convexity that enables efficient solution algorithms. Interestingly, the optimal solution promotes exclusive assignment of users to transmitters. Furthermore, we provide promising simulation results showing how the total power consumption can be greatly improved by combining massive MIMO and small cells; this is possible with both optimal and low-complexity beamforming.Comment: Published at International Conference on Telecommunications (ICT 2013), 6-8 May 2013, Casablanca, Morocco, 5 pages, 4 figures, 2 tables. This version includes the Matlab code necessary to reproduce the simulations; see the ancillary files. This version also corrects errors in Table 1 and in the simulations, which affected Figs. 3-