A greedy algorithm for pilot contamination mitigation using LAP

Abstract

Abstract In this paper, we propose a linear assignment problem (LAP) scheme using greedy algorithms to alleviate the intercell interference (ICI) in massive multi-input multiple-output (maMIMO) systems. ICI has been recognized as one of the main challenges of massive MIMO systems and occurs when pilot sequences (PSs) are reused across neighboring cells or using non-orthogonal PS, and this results in a phenomenon known as pilot contamination (PC). The proposed scheme uniquely assigns pilot sequences to mobile terminals to mitigate PC such that the optimal or near-optimal solution is achieved. This scheme attains maximum SINR by assigning pilot sequence to mobile terminals that will only produce the least PC. Results obtained from simulation showed that the proposed assignment scheme achieved a greater sum rate than some established assignment schemes when compared.

Keywords

• Massive MIMO
• Pilot sequence
• ICI
• Pilot contamination
• Pilot assignment
• Greedy algorithm