Pilot contamination due to pilot reuse in adjacent cells is a very serious problem in massive multi-input multiple-output (MIMO) systems. Therefore, proper pilot allocation is essential for improving system performance. In this paper, we formulate the pilot allocation optimization problem so as to maximize uplink sum rate of the system. To reduce the required complexity inherent in finding the optimum pilot allocation, we propose a low-complexity pilot allocation algorithm, where the formulated problem is decoupled into multiple subproblems; in each subproblem, the pilot allocation at a given cell is optimized while the pilot allocation in other cells id held fixed. This process is continued until the achievable sum rate converges. Through multiple iterations, the optimum pilot allocation is found. In addition, to improve users’ fairness, we formulate fairness-aware pilot allocation as maximization problem of sum of user’s logarithmic rate and solve the formulated problem using a similar algorithm. Simulation results show that the proposed algorithms match the good performance of the exhaustive search algorithm, meanwhile the users’ fairness is improved.
All Science Journal Classification (ASJC) codes
- コンピュータ ネットワークおよび通信