In order to solve the energy efficiency optimization problem in the uplink multi-cell massive MIMO system, this paper constructs the system transmission model, of which the channel is symmetry, based on user and base station, and deduces the expression of data transmission rate of each user. Then, we establish a model of the spectral and energy efficiency of multi-cell massive MIMO system by analyzing the pilot transmission and channel estimation. We also derive the nonconvex function for the energy efficiency optimization, which is difficult to solve directly. Therefore, we propose an improved particle swarm optimization algorithm to obtain the suboptimal solution, under low complexity, by optimizing the distribution of user power. To demonstrate the advantages of our proposed algorithm, we simulate the energy efficiency performance of the algorithm. The results show that the proposed algorithm can effectively improve the energy efficiency of the system.
To solve the energy efficiency (EE) optimization in a multi-cell (MU) massive multiple-input multiple-output (MIMO) downlink system, of which channels are of symmetry in the Time-Division Duplex (TDD) protocol, we utilize a spatially correlated channel model and adopt the minimum mean-squared error (MMSE) estimator to tailor linear precoding vectors. Then, we derive the expression of downlink spectral efficiency (SE), taking interference into account. Subsequently, we establish the EE optimization function, which is defined as the average capacity divided by power consumption. In an interference-limited scenario, the EE optimization is of high complexity to solve globally as it is not jointly concave. To this end, we propose the Dinkelbach-like power allocation algorithm to obtain a suboptimal solution. We transform the EE problem in a fractional form into a subtractive optimization form called an auxiliary subproblem. Then, we relax the sub-problem to a concave problem by initializing the interference and omitting the dynamic power term about throughput. Lastly, we solve iteratively the Karush–Kuhn–Tucker (KKT) conditions by bisection search. Consequently, we obtain a sub-solution with modest complexity. The simulation results justify the rationality of the Dinkelbach-like algorithm and demonstrate that the proposal outperforms the reference schemes and effectively improves the performance metrics EE and SE.