Achievable Rates of Multi-User Millimeter Wave Systems with Hybrid Precoding

Millimeter wave (mmWave) systems will likely employ large antenna arrays at both the transmitters and receivers. A natural application of antenna arrays is simultaneous transmission to multiple users, which requires multi-user precoding at the transmitter. Hardware constraints, however, make it difficult to apply conventional lower frequency MIMO precoding techniques at mmWave. This paper proposes and analyzes a low complexity hybrid analog/digital beamforming algorithm for downlink multi-user mmWave systems. Hybrid precoding involves a combination of analog and digital processing that is motivated by the requirement to reduce the power consumption of the complete radio frequency and mixed signal hardware. The proposed algorithm configures hybrid precoders at the transmitter and analog combiners at multiple receivers with a small training and feedback overhead. For this algorithm, we derive a lower bound on the achievable rate for the case of single-path channels, show its asymptotic optimality at large numbers of antennas, and make useful insights for more general cases. Simulation results show that the proposed algorithm offers higher sum rates compared with analog-only beamforming, and approaches the performance of the unconstrained digital precoding solutions.Comment: to be presented in IEEE ICC 2015 - Workshop on 5G & Beyond - Enabling Technologies and Application

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

Two-Stage Subspace Constrained Precoding in Massive MIMO Cellular Systems

We propose a subspace constrained precoding scheme that exploits the spatial channel correlation structure in massive MIMO cellular systems to fully unleash the tremendous gain provided by massive antenna array with reduced channel state information (CSI) signaling overhead. The MIMO precoder at each base station (BS) is partitioned into an inner precoder and a Transmit (Tx) subspace control matrix. The inner precoder is adaptive to the local CSI at each BS for spatial multiplexing gain. The Tx subspace control is adaptive to the channel statistics for inter-cell interference mitigation and Quality of Service (QoS) optimization. Specifically, the Tx subspace control is formulated as a QoS optimization problem which involves an SINR chance constraint where the probability of each user's SINR not satisfying a service requirement must not exceed a given outage probability. Such chance constraint cannot be handled by the existing methods due to the two stage precoding structure. To tackle this, we propose a bi-convex approximation approach, which consists of three key ingredients: random matrix theory, chance constrained optimization and semidefinite relaxation. Then we propose an efficient algorithm to find the optimal solution of the resulting bi-convex approximation problem. Simulations show that the proposed design has significant gain over various baselines.Comment: 13 pages, accepted by IEEE Transactions on Wireless Communication