Joint Transmit Antennas for Energy Efficiency in Downlink Massive MIMO Systems

Massive multiple-input-multiple-output (MIMO) systems are an exciting area of fifth-generation (5G) technology and very important in maximizing energy efficiency (EE) and saving battery technology.  Obtaining energy efficiency without sacrificing the quality of service (QoS) has become increasingly important for mobile devices. In this paper, we investigate the maximal EE for downlink massive MIMO systems using zero-forcing beamforming (ZFBF), dependent on the number of antenna elements and the optimal number of users inside the cell to optimize the transmit power. The linear precoding ZFBF is able to mitigate interbeam interference, in addition to noise, due to expanding the reception at low  power transmission.  The simulation results reveal that the maximal energy efficiency  can be obtained dependent on increasing the number of antennas M and choosing the  , where the number of antennas is greater than the critical number of antennas   , which minimizes the received interference due to increased transmit power

Joint Power Allocation and User Association Optimization for Massive MIMO Systems

This paper investigates the joint power allocation and user association problem in multi-cell Massive MIMO (multiple-input multiple-output) downlink (DL) systems. The target is to minimize the total transmit power consumption when each user is served by an optimized subset of the base stations (BSs), using non-coherent joint transmission. We first derive a lower bound on the ergodic spectral efficiency (SE), which is applicable for any channel distribution and precoding scheme. Closed-form expressions are obtained for Rayleigh fading channels with either maximum ratio transmission (MRT) or zero forcing (ZF) precoding. From these bounds, we further formulate the DL power minimization problems with fixed SE constraints for the users. These problems are proved to be solvable as linear programs, giving the optimal power allocation and BS-user association with low complexity. Furthermore, we formulate a max-min fairness problem which maximizes the worst SE among the users, and we show that it can be solved as a quasi-linear program. Simulations manifest that the proposed methods provide good SE for the users using less transmit power than in small-scale systems and the optimal user association can effectively balance the load between BSs when needed. Even though our framework allows the joint transmission from multiple BSs, there is an overwhelming probability that only one BS is associated with each user at the optimal solution.Comment: 16 pages, 12 figures, Accepted by IEEE Trans. Wireless Commu

Downlink Power Control for Massive MIMO Cellular Systems with Optimal User Association

This paper aims to minimize the total transmit power consumption for Massive MIMO (multiple-input multiple-output) downlink cellular systems when each user is served by the optimized subset of the base stations (BSs). We derive a lower bound on the ergodic spectral efficiency (SE) for Rayleigh fading channels and maximum ratio transmission (MRT) when the BSs cooperate using non-coherent joint transmission. We solve the joint user association and downlink transmit power minimization problem optimally under fixed SE constraints. Furthermore, we solve a max-min fairness problem with user specific weights that maximizes the worst SE among the users. The optimal BS-user association rule is derived, which is different from maximum signal-to-noise-ratio (max-SNR) association. Simulation results manifest that the proposed methods can provide good SE for the users using less transmit power than in small-scale systems and that the optimal user association can effectively balance the load between BSs when needed

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