Multicast Multigroup Beamforming for Per-antenna Power Constrained Large-scale Arrays

Large in the number of transmit elements, multi-antenna arrays with per-element limitations are in the focus of the present work. In this context, physical layer multigroup multicasting under per-antenna power constrains, is investigated herein. To address this complex optimization problem low-complexity alternatives to semi-definite relaxation are proposed. The goal is to optimize the per-antenna power constrained transmitter in a maximum fairness sense, which is formulated as a non-convex quadratically constrained quadratic problem. Therefore, the recently developed tool of feasible point pursuit and successive convex approximation is extended to account for practical per-antenna power constraints. Interestingly, the novel iterative method exhibits not only superior performance in terms of approaching the relaxed upper bound but also a significant complexity reduction, as the dimensions of the optimization variables increase. Consequently, multicast multigroup beamforming for large-scale array transmitters with per-antenna dedicated amplifiers is rendered computationally efficient and accurate. A preliminary performance evaluation in large-scale systems for which the semi-definite relaxation constantly yields non rank-1 solutions is presented.Comment: submitted to IEEE SPAWC 2015. arXiv admin note: substantial text overlap with arXiv:1406.755

Symbol-level and Multicast Precoding for Multiuser Multiantenna Downlink: A State-of-the-art, Classification and Challenges

Precoding has been conventionally considered as an effective means of mitigating or exploiting the interference in the multiantenna downlink channel, where multiple users are simultaneously served with independent information over the same channel resources. The early works in this area were focused on transmitting an individual information stream to each user by constructing weighted linear combinations of symbol blocks (codewords). However, more recent works have moved beyond this traditional view by: i) transmitting distinct data streams to groups of users and ii) applying precoding on a symbol-per-symbol basis. In this context, the current survey presents a unified view and classification of precoding techniques with respect to two main axes: i) the switching rate of the precoding weights, leading to the classes of block-level and symbol-level precoding, ii) the number of users that each stream is addressed to, hence unicast, multicast, and broadcast precoding. Furthermore, the classified techniques are compared through representative numerical results to demonstrate their relative performance and uncover fundamental insights. Finally, a list of open theoretical problems and practical challenges are presented to inspire further research in this area

Novel transmission and beamforming strategies for multiuser MIMO with various CSIT types

In multiuser multi-antenna wireless systems, the transmission and beamforming strategies that achieve the sum rate capacity depend critically on the acquisition of perfect Channel State Information at the Transmitter (CSIT). Accordingly, a high-rate low-latency feedback link between the receiver and the transmitter is required to keep the latter accurately and instantaneously informed about the CSI. In realistic wireless systems, however, only imperfect CSIT is achievable due to pilot contamination, estimation error, limited feedback and delay, etc. As an intermediate solution, this thesis investigates novel transmission strategies suitable for various imperfect CSIT scenarios and the associated beamforming techniques to optimise the rate performance. First, we consider a two-user Multiple-Input-Single-Output (MISO) Broadcast Channel (BC) under statistical and delayed CSIT. We mainly focus on linear beamforming and power allocation designs for ergodic sum rate maximisation. The proposed designs enable higher sum rate than the conventional designs. Interestingly, we propose a novel transmission framework which makes better use of statistical and delayed CSIT and smoothly bridges between statistical CSIT-based strategies and delayed CSIT-based strategies. Second, we consider a multiuser massive MIMO system under partial and statistical CSIT. In order to tackle multiuser interference incurred by partial CSIT, a Rate-Splitting (RS) transmission strategy has been proposed recently. We generalise the idea of RS into the large-scale array. By further exploiting statistical CSIT, we propose a novel framework Hierarchical-Rate-Splitting that is particularly suited to massive MIMO systems. Third, we consider a multiuser Millimetre Wave (mmWave) system with hybrid analog/digital precoding under statistical and quantised CSIT. We leverage statistical CSIT to design digital precoder for interference mitigation while all feedback overhead is reserved for precise analog beamforming. For very limited feedback and/or very sparse channels, the proposed precoding scheme yields higher sum rate than the conventional precoding schemes under a fixed total feedback constraint. Moreover, a RS transmission strategy is introduced to further tackle the multiuser interference, enabling remarkable saving in feedback overhead compared with conventional transmission strategies. Finally, we investigate the downlink hybrid precoding for physical layer multicasting with a limited number of RF chains. We propose a low complexity algorithm to compute the analog precoder that achieves near-optimal max-min performance. Moreover, we derive a simple condition under which the hybrid precoding driven by a limited number of RF chains incurs no loss of optimality with respect to the fully digital precoding case.Open Acces

Non-convex Quadratically Constrained Quadratic Programming: Hidden Convexity, Scalable Approximation and Applications

University of Minnesota Ph.D. dissertation. September 2017. Major: Electrical Engineering. Advisor: Nicholas Sidiropoulos. 1 computer file (PDF); viii, 85 pages.Quadratically Constrained Quadratic Programming (QCQP) constitutes a class of computationally hard optimization problems that have a broad spectrum of applications in wireless communications, networking, signal processing, power systems, and other areas. The QCQP problem is known to be NP–hard in its general form; only in certain special cases can it be solved to global optimality in polynomial-time. Such cases are said to be convex in a hidden way, and the task of identifying them remains an active area of research. Meanwhile, relatively few methods are known to be effective for general QCQP problems. The prevailing approach of Semidefinite Relaxation (SDR) is computationally expensive, and often fails to work for general non-convex QCQP problems. Other methods based on Successive Convex Approximation (SCA) require initialization from a feasible point, which is NP-hard to compute in general. This dissertation focuses on both of the above mentioned aspects of non-convex QCQP. In the first part of this work, we consider the special case of QCQP with Toeplitz-Hermitian quadratic forms and establish that it possesses hidden convexity, which makes it possible to obtain globally optimal solutions in polynomial-time. The second part of this dissertation introduces a framework for efficiently computing feasible solutions of general quadratic feasibility problems. While an approximation framework known as Feasible Point Pursuit-Successive Convex Approximation (FPP-SCA) was recently proposed for this task, with considerable empirical success, it remains unsuitable for application on large-scale problems. This work is primarily focused on speeding and scaling up these approximation schemes to enable dealing with large-scale problems. For this purpose, we reformulate the feasibility criteria employed by FPP-SCA for minimizing constraint violations in the form of non-smooth, non-convex penalty functions. We demonstrate that by employing judicious approximation of the penalty functions, we obtain problem formulations which are well suited for the application of first-order methods (FOMs). The appeal of using FOMs lies in the fact that they are capable of efficiently exploiting various forms of problem structure while being computationally lightweight. This endows our approximation algorithms the ability to scale well with problem dimension. Specific applications in wireless communications and power grid system optimization considered to illustrate the efficacy of our FOM based approximation schemes. Our experimental results reveal the surprising effectiveness of FOMs for this class of hard optimization problems

A rate-splitting approach to multiple-antenna broadcasting

Signal processing techniques for multiple-antenna transmission can exploit the spatial dimension of the wireless channel to serve multiple users simultaneously, achieving high spectral efficiencies. Realizing such gains; however, is strongly dependent on the availability of highly accurate and up-to-date Channel State Information at the Transmitter (CSIT). This stems from the necessity to deal with multiuser interference through preprocessing; as receivers cannot coordinate in general. In wireless systems, CSIT is subject to uncertainty due to estimation and quantization errors, delays and mismatches. This thesis proposes optimized preprocessing techniques for broadcasting scenarios where a multi-antenna transmitter communicates with single-antenna receivers under CSIT uncertainties. First, we consider a scenario where the transmitter communicates an independent message to each receiver. The most popular preprocessing techniques in this setup are based on linear precoding (or beamforming). Despite their near-optimum rate performances when highly accurate CSIT is available, we show that such techniques exhibit severe losses under CSIT uncertainties, even when optimally designed. We depart from this conventional approach and adopt an unorthodox transmission strategy based on Rate-Splitting (RS), which relies on broadcasting a common data stream on top of the private data streams precoded using partial CSIT. We propose an average Weighted Minimum Mean Square Error (WMMSE) algorithm to maximize the ergodic sum-rate performance. While the ergodic sum-rate measure captures the long-term overall performance, it is not well suited for delay-limited or fairness based transmissions. Hence, we generalize the RS strategy to formulate the problem of achieving robust max-min fairness over one random fading state under a bounded CSIT uncertainty model. We derive new performance limits in terms of the symmetric-DoF under heterogeneous CSIT qualities across users to identify the RS gains. Then, a robust WMMSE algorithm based on the cutting-set method is proposed to solve the semi-infinite optimization problem. This framework is extended to address the problem of power minimization under Quality of Service (QoS) constraints. Finally, we consider the problem of achieving max-min fairness in a multigroup multicasting scenario, where each message is intended to a group of users. We assume perfect CSIT in this setup, where the presence of multiple users in each group is thought of as a source of (finite) uncertainty. The DoF performance of conventional beamforming techniques are derived from which their limitations are identified. The RS strategy is then extended to this scenario, where we show that significant DoF gains can be achieved. The RS precoder optimization problem in this setup is then solved using the WMMSE approach.Open Acces