Group Sparse Precoding for Cloud-RAN with Multiple User Antennas

Cloud radio access network (C-RAN) has become a promising network architecture to support the massive data traffic in the next generation cellular networks. In a C-RAN, a massive number of low-cost remote antenna ports (RAPs) are connected to a single baseband unit (BBU) pool via high-speed low-latency fronthaul links, which enables efficient resource allocation and interference management. As the RAPs are geographically distributed, the group sparse beamforming schemes attracts extensive studies, where a subset of RAPs is assigned to be active and a high spectral efficiency can be achieved. However, most studies assumes that each user is equipped with a single antenna. How to design the group sparse precoder for the multiple antenna users remains little understood, as it requires the joint optimization of the mutual coupling transmit and receive beamformers. This paper formulates an optimal joint RAP selection and precoding design problem in a C-RAN with multiple antennas at each user. Specifically, we assume a fixed transmit power constraint for each RAP, and investigate the optimal tradeoff between the sum rate and the number of active RAPs. Motivated by the compressive sensing theory, this paper formulates the group sparse precoding problem by inducing the $\ell_0$-norm as a penalty and then uses the reweighted $\ell_1$ heuristic to find a solution. By adopting the idea of block diagonalization precoding, the problem can be formulated as a convex optimization, and an efficient algorithm is proposed based on its Lagrangian dual. Simulation results verify that our proposed algorithm can achieve almost the same sum rate as that obtained from exhaustive search

Towards Dual-functional Radar-Communication Systems: Optimal Waveform Design

We focus on a dual-functional multi-input-multi-output (MIMO) radar-communication (RadCom) system, where a single transmitter communicates with downlink cellular users and detects radar targets simultaneously. Several design criteria are considered for minimizing the downlink multi-user interference. First, we consider both the omnidirectional and directional beampattern design problems, where the closed-form globally optimal solutions are obtained. Based on these waveforms, we further consider a weighted optimization to enable a flexible trade-off between radar and communications performance and introduce a low-complexity algorithm. The computational costs of the above three designs are shown to be similar to the conventional zero-forcing (ZF) precoding. Moreover, to address the more practical constant modulus waveform design problem, we propose a branch-and-bound algorithm that obtains a globally optimal solution and derive its worst-case complexity as a function of the maximum iteration number. Finally, we assess the effectiveness of the proposed waveform design approaches by numerical results.Comment: 13 pages, 10 figures. This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

Multi-user spatial diversity techniques for wireless communication systems

Multiple antennas at the transmitter and receiver, formally known as multiple-input multiple-output (MIMO) systems have the potential to either increase the data rates through spatial multiplexing or enhance the quality of services through exploitation of diversity. In this thesis, the problem of downlink spatial multiplexing, where a base station (BS) serves multiple users simultaneously in the same frequency band is addressed. Spatial multiplexing techniques have the potential to make huge saving in the bandwidth utilization. We propose spatial diversity techniques with and without the assumption of perfect channel state information (CSI) at the transmitter. We start with proposing improvement to signal-to-leakage ratio (SLR) maximization based spatial multiplexing techniques for both fiat fading and frequency selective channels. [Continues.

Fast converging robust beamforming for downlink massive MIMO systems in heterogenous networks

Massive multiple-input multiple-output (MIMO) is an emerging technology, which is an enabler for future broadband wireless networks that support high speed connection of densely populated areas. Application of massive MIMO at the macrocell base stations in heterogeneous networks (HetNets) offers an increase in throughput without increasing the bandwidth, but with reduced power consumption. This research investigated the optimisation problem of signal-to-interference-plus-noise ratio (SINR) balancing for macrocell users in a typical HetNet scenario with massive MIMO at the base station. The aim was to present an efficient beamforming solution that would enhance inter-tier interference mitigation in heterogeneous networks. The system model considered the case of perfect channel state information (CSI) acquisition at the transmitter, as well as the case of imperfect CSI at the transmitter. A fast converging beamforming solution, which is applicable to both channel models, is presented. The proposed beamforming solution method applies the matrix stuffing technique and the alternative direction method of multipliers, in a two-stage fashion, to give a modestly accurate and efficient solution. In the first stage, the original optimisation problem is transformed into standard second-order conic program (SOCP) form using the Smith form reformulation and applying the matrix stuffing technique for fast transformation. The second stage uses the alternative direction method of multipliers to solve the SOCP-based optimisation problem. Simulations to evaluate the SINR performance of the proposed solution method were carried out with supporting software-based simulations using relevant MATLAB toolboxes. The simulation results of a typical single cell in a HetNet show that the proposed solution gives performance with modest accuracy, while converging in an efficient manner, compared to optimal solutions achieved by state-of-the-art modelling languages and interior-point solvers. This is particularly for cases when the number of antennas at the base station increases to large values, for both models of perfect CSI and imperfect CSI. This makes the solution method attractive for practical implementation in heterogeneous networks with large scale antenna arrays at the macrocell base station.Dissertation (MEng)--University of Pretoria, 2018.Electrical, Electronic and Computer EngineeringMEngUnrestricte

Distributed optimisation techniques for wireless networks

Alongside the ever increasing traffic demand, the fifth generation (5G) cellular network architecture is being proposed to provide better quality of service, increased data rate, decreased latency, and increased capacity. Without any doubt, the 5G cellular network will comprise of ultra-dense networks and multiple input multiple output technologies. This will make the current centralised solutions impractical due to increased complexity. Moreover, the amount of coordination information that needs to be transported over the backhaul links will be increased. Distributed or decentralised solutions are promising to provide better alternatives. This thesis proposes new distributed algorithms for wireless networks which aim to reduce the amount of system overheads in the backhaul links and the system complexity. The analysis of conflicts amongst transmitters, and resource allocation are conducted via the use of game theory, convex optimisation, and auction theory. Firstly, game-theoretic model is used to analyse a mixed quality of service (QoS) strategic non-cooperative game (SNG), for a two-user multiple-input single-output (MISO) interference channel. The players are considered to have different objectives. Following this, the mixed QoS SNG is extended to a multicell multiuser network in terms of signal-to-interference-and-noise ratio (SINR) requirement. In the multicell multiuser setting, each transmitter is assumed to be serving real time users (RTUs) and non-real time users (NRTUs), simultaneously. A novel mixed QoS SNG algorithm is proposed, with its operating point identified as the Nash equilibrium-mixed QoS (NE-mixed QoS). Nash, Kalai-Smorodinsky, and Egalitarian bargain solutions are then proposed to improve the performance of the NE-mixed QoS. The performance of the bargain solutions are observed to be comparable to the centralised solutions. Secondly, user offloading and user association problems are addressed for small cells using auction theory. The main base station wishes to offload some of its users to privately owned small cell access points. A novel bid-wait-auction (BWA) algorithm, which allows single-item bidding at each auction round, is designed to decompose the combinatorial mathematical nature of the problem. An analysis on the existence and uniqueness of the dominant strategy equilibrium is conducted. The BWA is then used to form the forward BWA (FBWA) and the backward BWA (BBWA). It is observed that the BBWA allows more users to be admitted as compared to the FBWA. Finally, simultaneous multiple-round ascending auction (SMRA), altered SMRA (ASMRA), sequential combinatorial auction with item bidding (SCAIB), and repetitive combinatorial auction with item bidding (RCAIB) algorithms are proposed to perform user offloading and user association for small cells. These algorithms are able to allow bundle bidding. It is then proven that, truthful bidding is individually rational and leads to Walrasian equilibrium. The performance of the proposed auction based algorithms is evaluated. It is observed that the proposed algorithms match the performance of the centralised solutions when the guest users have low target rates. The SCAIB algorithm is shown to be the most preferred as it provides high admission rate and competitive revenue to the bidders