An Overview of Massive MIMO Technology Components in METIS

As the standardization of full-dimension MIMO systems in the Third Generation Partnership Project progresses, the research community has started to explore the potential of very large arrays as an enabler technology for meeting the requirements of fifth generation systems. Indeed, in its final deliverable, the European 5G project METIS identifies massive MIMO as a key 5G enabler and proposes specific technology components that will allow the cost-efficient deployment of cellular systems taking advantage of hundreds of antennas at cellular base stations. These technology components include handling the inherent pilot-data resource allocation trade-off in a near optimal fashion, a novel random access scheme supporting a large number of users, coded channel state information for sparse channels in frequency-division duplexing systems, managing user grouping and multi-user beamforming, and a decentralized coordinated transceiver design. The aggregate effect of these components enables massive MIMO to contribute to the METIS objectives of delivering very high data rates and managing dense populations

Power allocation and user selection in multi-cell: multi-user massive MIMO systems

Submitted in fulfilment of the academic requirements for the degree of Master of Science (Msc) in Engineering, in the School of Electrical and Information Engineering (EIE), Faculty of Engineering and the Built Environment, at the University of the Witwatersrand, Johannesburg, South Africa, 2017The benefits of massive Multiple-Input Multiple-Output (MIMO) systems have made it a solution for future wireless networking demands. The increase in the number of base station antennas in massive MIMO systems results in an increase in capacity. The throughput increases linearly with an increase in number of antennas. To reap all the benefits of massive MIMO, resources should be allocated optimally amongst users. A lot of factors have to be taken into consideration in resource allocation in multi-cell massive MIMO systems (e.g. intra-cell, inter-cell interference, large scale fading etc.) This dissertation investigates user selection and power allocation algorithms in multi-cell massive MIMO systems. The focus is on designing algorithms that maximizes a particular cell of interest’s sum rate capacity taking into consideration the interference from other cells. To maximize the sum-rate capacity there is need to optimally allocate power and select the optimal number of users who should be scheduled. Global interference coordination has very high complexity and is infeasible in large networks. This dissertation extends previous work and proposes suboptimal per cell resource allocation models that are feasible in practice. The interference is introduced when non-orthogonal pilots are used for channel estimation, resulting in pilot contamination. Resource allocation values from interfering cells are unknown in per cell resource allocation models, hence the inter-cell interference has to be modelled. To tackle the problem sum-rate expressions are derived to enable power allocation and user selection algorithm analysis. The dissertation proposes three different approaches for solving resource allocation problems in multi-cell multi-user massive MIMO systems for a particular cell of interest. The first approach proposes a branch and bound algorithm (BnB algorithm) which models the inter-cell interference in terms of the intra-cell interference by assuming that the statistical properties of the intra-cell interference in the cell of interest are the same as in the other interfering cells. The inter-cell interference is therefore expressed in terms of the intra-cell interference multiplied by a correction factor. The correction factor takes into consideration pilot sequences used in the interfering cells in relation to pilot sequences used in the cell of interest and large scale fading between the users in the interfering cells and the users in the cell of interest. The resource allocation problem is modelled as a mixed integer programming problem. The problem is NP-hard and cannot be solved in polynomial time. To solve the problem it is converted into a convex optimization problem by relaxing the user selection constraint. Dual decomposition is used to solve the problem. In the second approach (two stage algorithm) a mathematical model is proposed for maximum user scheduling in each cell. The scheduled users are then optimally allocated power using the multilevel water filling approach. Finally a hybrid algorithm is proposed which combines the two approaches described above. Generally in the hybrid algorithm the cell of interest allocates resources in the interfering cells using the two stage algorithm to obtain near optimal resource allocation values. The cell of interest then uses these near optimal values to perform its own resource allocation using the BnB algorithm. The two stage algorithm is chosen for resource allocation in the interfering cells because it has a much lower complexity compared to the BnB algorithm. The BnB algorithm is chosen for resource allocation in the cell of interest because it gives higher sum rate in a sum rate maximization problem than the two stage algorithm. Performance analysis and evaluation of the developed algorithms have been presented mainly through extensive simulations. The designed algorithms have also been compared to existing solutions. In general the presented results demonstrate that the proposed algorithms perform better than the existing solutions.XL201

Pilot Contamination and Mitigation Techniques in Massive MIMO Systems

A multi-antenna base station (BS) can spatially multiplex a few terminals over the same bandwidth, a technique known as multi-user, multiple-input multiple-output (MU-MIMO). A new idea in cellular MU-MIMO is the use of a large excess of BS antennas to serve several single-antenna terminals simultaneously. This so-called "massive MIMO" promises attractive gains in spectral efficiency with time-division duplex operation. Within a cell, the BS estimates the channel from mutually orthogonal reverse-link pilot sequences to formulate a receiver for the reverse link and (assuming reciprocity) a precoder for the forward link. The channel coherence is typically constrained in time as well as frequency, leading to a trade-off between the resources spent on pilots and those available for data symbols. This pilot overhead can be reduced by reusing pilot sequences in nearby cells, however this potentially introduces interference in the channel estimation phase, the so-called "pilot contamination" effect. In this thesis, we study the impact of pilot contamination in realistic environments and investigate schemes to mitigate it. We evaluate the mean squared error (MSE) of channel estimates in case of a plain-vanilla least-squares (LS) estimator and a minimum MSE (MMSE) estimator that exploits prior knowledge of second-order channel statistics. Next, we introduce a pilot open-loop power control (pilot OLPC) scheme to improve the SINR-fairness of received pilot signals at the BS. We evaluate the effect of relaxing the pilot reuse factor and also implement a soft pilot reuse (SPR) scheme to distribute pilot sequences efficiently. To study the trade-off between pilot and data symbols, we evaluate the achievable rate in forward link with maximum-ratio and zero-forcing precoding at the BS. We evaluate an inter-cell coordination scheme that exploits prior knowledge of all cross-channel covariance matrices to reuse pilots among spatially well-separated terminals. We simulate a 21-cell MU-MIMO setup with up to 100-antenna BSs and up to 24 single-antenna terminals per cell in an outdoor urban macro environment. We find that pilot reuse 1 causes severe impairment of the channel estimates, which can be improved with pilot OLPC. Pilot reuse 1/3 effectively mitigates pilot contamination, and can improve the achievable rate in the forward link. SPR also mitigates contamination but with a smaller increase in pilot overhead. Inter-cell coordinated pilot allocation, implemented using a greedy approach, provides gains over random allocation only for the initial few pilots. In general, maximum ratio precoding is more robust against pilot contamination than zero-forcing.A multi-antenna base station (BS) can be used to improve cellular communication performance. The signal at each antenna can be designed in a way that it increases received energy at the desired terminals, and attenuates it at other locations (reducing interference). This technique can be used to serve several terminals over the same time and frequency using independent data streams, known as multi-user MIMO (MU-MIMO). In this thesis, we investigate MU-MIMO approach for very large BS antenna arrays, also called massive MIMO. The performance of such systems depends critically on the quality of channel estimates the BS. We simulate realistic channel conditions in a multi-cell setup, which gives rise to interference during channel estimation. We evaluate the system performance in terms of quality of BS channel estimates and the achievable data rate within a cell. We evaluate different techniques for channel estimation, and for generating data streams from the BS to the terminals. Next, we evaluate schemes to improve the channel estimation. We conclude by noting the trade-offs involved in the various schemes and the conditions under which certain schemes might provide performance improvements

Coordinated Multi-cell Beamforming for Massive MIMO: A Random Matrix Approach

We consider the problem of coordinated multi- cell downlink beamforming in massive multiple input multiple output (MIMO) systems consisting of N cells, Nt antennas per base station (BS) and K user terminals (UTs) per cell. Specifically, we formulate a multi-cell beamforming algorithm for massive MIMO systems which requires limited amount of information exchange between the BSs. The design objective is to minimize the aggregate transmit power across all the BSs subject to satisfying the user signal to interference noise ratio (SINR) constraints. The algorithm requires the BSs to exchange parameters which can be computed solely based on the channel statistics rather than the instantaneous CSI. We make use of tools from random matrix theory to formulate the decentralized algorithm. We also characterize a lower bound on the set of target SINR values for which the decentralized multi-cell beamforming algorithm is feasible. We further show that the performance of our algorithm asymptotically matches the performance of the centralized algorithm with full CSI sharing. While the original result focuses on minimizing the aggregate transmit power across all the BSs, we formulate a heuristic extension of this algorithm to incorporate a practical constraint in multi-cell systems, namely the individual BS transmit power constraints. Finally, we investigate the impact of imperfect CSI and pilot contamination effect on the performance of the decentralized algorithm, and propose a heuristic extension of the algorithm to accommodate these issues. Simulation results illustrate that our algorithm closely satisfies the target SINR constraints and achieves minimum power in the regime of massive MIMO systems. In addition, it also provides substantial power savings as compared to zero-forcing beamforming when the number of antennas per BS is of the same orders of magnitude as the number of UTs per cell

Indoor Massive MIMO Deployments for Uniformly High Wireless Capacity

Providing consistently high wireless capacity is becoming increasingly important to support the applications required by future digital enterprises. In this paper, we propose Eigen-direction-aware ZF (EDA-ZF) with partial coordination among base stations (BSs) and distributed interference suppression as a practical approach to achieve this objective. We compare our solution with Zero Forcing (ZF), entailing neither BS coordination or inter-cell interference mitigation, and Network MIMO (NeMIMO), where full BS coordination enables centralized inter-cell interference management. We also evaluate the performance of said schemes for three sub-6 GHz deployments with varying BS densities -- sparse, intermediate, and dense -- all with fixed total number of antennas and radiated power. Extensive simulations show that: (i) indoor massive MIMO implementing the proposed EDA-ZF provides uniformly good rates for all users; (ii) indoor network densification is detrimental unless full coordination is implemented; (iii) deploying NeMIMO pays off under strong outdoor interference, especially for cell-edge users