Cell-Free Massive MIMO and Millimeter Wave Channel Modelling for 5G and Beyond

Huge demand for wireless throughput and number of users which are connected to the base station (BS) has been observed in the last decades. Massive multiple-input multiple-output (MIMO) is a promising technique for 5G for the following reasons; 1) high throughput; 2) serving large numbers of users at the same time; 3) energy efficiency. However, the low throughput of cell-edge users remains a limitation in realistic multi-cell massive MIMO systems. In cell-free massive MIMO, on the other hand, distributed access points (APs) are connected to a central processing unit (CPU) and jointly serve distributed users. This thesis investigates the performance of cell-free Massive MIMO with limited-capacity fronthaul links from the APs to the CPU which will be essential in practical 5G networks. To model the limited-capacity fronthaul links, we exploit the optimal uniform quantization. Next, closed-form expressions for spectral and energy efficiencies are presented. Numerical results investigate the performance gap between limited fronthaul and perfect fronthaul cases, and demonstrate that exploiting a relatively few quantization bits, the performance of limited-fronthaul cell-free Massive MIMO closely approaches the perfect fronthaul performance. Next, the energy efficiency maximization problem and max-min fairness problems are considered with per-user power and fronthaul capacity constraints. We propose an iterative procedure which exploits a generalized eigen vector problem and geometric programming (GP) to solve the max-min optimization problem. Numerical results indicate the superiority of the proposed algorithms over the case of equal power allocation. On the other hand, the performance of communication systems depends on the propagation channel. To investigate the performance of MIMO systems, an accurate small scale fading channel model is necessary. Geometry-based stochastic channel models (GSCMs) are mathematically tractable models to investigate the performance of MIMO systems

Ultra-dense Radio Access Networks for Smart Cities: Cloud-RAN, Fog-RAN and "cell-free" Massive MIMO

In this paper we discuss the requirements for a radio access network architecture for ultra-dense networks for "smart city" applications, and show that coordination is required between access points to overcome the effects of interference. We propose a new paradigm, Fog Massive MIMO, based on a combination of the "cell-free" massive MIMO concept and the Fog Radio Access Network (F-RAN). In particular we analyze the potential benefit of improved coordination between APs over different coordination ranges.Comment: PIMRC1

Robust User Scheduling with COST 2100 Channel Model for Massive MIMO Networks

The problem of user scheduling with reduced overhead of channel estimation in the uplink of massive multiple-input multiple-output (MIMO) systems has been investigated. The authors consider the COST 2100 channel model. In this paper, they first propose a new user selection algorithm based on knowledge of the geometry of the service area and location of clusters, without having full channel state information at the BS. They then show that the correlation in geometry-based stochastic channel models (GSCMs) arises from the common clusters in the area. In addition, exploiting the closed-form Cramer–Rao lower bounds, the analysis for the robustness of the proposed scheme to cluster position errors is presented. It is shown by analysing the capacity upper bound that the capacity strongly depends on the position of clusters in the GSCMs and users in the system. Simulation results show that though the BS receiver does not require the channel information of all users, by the proposed geometry-based user scheduling algorithm the sum rate of the system is only slightly less than the well known greedy weight clique scheme

On The Uplink Throughput of Zero-Forcing in Cell-Free Massive MIMO with Coarse Quantization

The recently proposed Cell-Free massive MIMO architecture is studied for the uplink. In contrast to most previous works, joint detection is performed using global CSI. Therefore, we study strategies for transferring CSI to the CPU taking into account the fronthaul capacity which limits CSI quantization. Two strategies for pilot-based CSI acquisition are considered: estimate-and-quantize and quantize-and-estimate. These are analysed using the Bussgang decomposition. For a given quantization constraint for the data and CSI the achievable rate per user with Zero-Forcing is determined. Numerical results show that quantize-and-estimate (the simpler strategy) is similar to or better than estimate-and-quantize at low resolution, especially for 1-bit

On the Performance of Cell-Free Massive MIMO Relying on Adaptive NOMA/OMA Mode-Switching

The downlink (DL) of a non-orthogonal-multiple-access (NOMA)-based cell-free massive multiple-input multipleoutput (MIMO) system is analyzed, where the channel state information (CSI) is estimated using pilots. It is assumed that the users are grouped into multiple clusters. The same pilot sequences are assigned to the users within the same clusters whereas the pilots allocated to all clusters are mutually orthogonal. First, a user’s bandwidth efficiency (BE) is derived based on his/her channel statistics under the assumption of employing successive interference cancellation (SIC) at the users’ end with no DL training. Next, the classic max-min optimization framework is invoked for maximizing the minimum BE of a user under peraccess point (AP) power constraints. The max min user BE of NOMA-based cell-free massive MIMO is compared to that of its orthogonal multiple-access (OMA) counter part, where all users employ orthogonal pilots. Finally, our numerical results are presented and an operating mode switching scheme is proposed based on the average per-user BE of the system, where the mode set is given by Mode = { OMA, NOMA }. Our numerical results confirm that the switching point between the NOMA and OMA modes depends both on the length of the channel’s coherence time and on the total number of users