Uplink Pilot Allocation for Multi-Cell Massive MIMO Systems

被引:3
作者
Hao, Wanming [1 ,2 ,3 ]
Muta, Osamu [4 ]
Gacanin, Haris [5 ]
Furukawa, Hiroshi [3 ]
机构
[1] Zhengzhou Univ, Inst Ind Technol, Zhengzhou 450001, Henan, Peoples R China
[2] Zhengzhou Univ, Sch Informat Engn, Zhengzhou 450001, Henan, Peoples R China
[3] Kyushu Univ, Fukuoka, Fukuoka 8190395, Japan
[4] Kyushu Univ, Grad Sch Informat Sci & Elect Engn, Fukuoka, Fukuoka 8190395, Japan
[5] Nokia Bell Labs, Antwerp, Belgium
基金
中国国家自然科学基金;
关键词
pilot contamination; massive MIMO; pilot allocation; RESOURCE-ALLOCATION; ASSIGNMENT; WIRELESS; NETWORKS;
D O I
10.1587/transcom.2017EBP3312
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:373 / 380
页数:8
相关论文
共 16 条
[1]  
[Anonymous], IEEE VEH TECHN C FAL
[2]  
[Anonymous], P IEEE INT WORKSH SI
[3]  
Atzeni I, 2015, IEEE INT CONF COMM, P1030, DOI 10.1109/ICCW.2015.7247312
[4]   Massive MIMO for Maximal Spectral Efficiency: How Many Users and Pilots Should Be Allocated? [J].
Bjornson, Emil ;
Larsson, Erik G. ;
Debbah, Merouane .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2016, 15 (02) :1293-1308
[5]   A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method [J].
Hahn, P ;
Grant, T ;
Hall, N .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 108 (03) :629-640
[6]   Power Allocation for Massive MIMO Cognitive Radio Networks With Pilot Sharing Under SINR Requirements of Primary Users [J].
Hao, Wanming ;
Muta, Osamu ;
Gacanin, Haris ;
Furukawa, Hiroshi .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (02) :1174-1186
[7]   Energy-Efficient Resource Allocation for mmWave Massive MIMO HetNets With Wireless Backhaul [J].
Hao, Wanming ;
Zeng, Ming ;
Chu, Zheng ;
Yang, Shouyi ;
Sun, Gangcan .
IEEE ACCESS, 2018, 6 :2457-2471
[8]   Energy and Spectral Efficiency of Very Large Multiuser MIMO Systems [J].
Hien Quoc Ngo ;
Larsson, Erik G. ;
Marzetta, Thomas L. .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2013, 61 (04) :1436-1449
[9]   Pilot Contamination and Precoding in Multi-Cell TDD Systems [J].
Jose, Jubin ;
Ashikhmin, Alexei ;
Marzetta, Thomas L. ;
Vishwanath, Sriram .
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2011, 10 (08) :2640-2651
[10]   The Hungarian Method for the assignment problem [J].
Kuhn, HW .
NAVAL RESEARCH LOGISTICS, 2005, 52 (01) :7-21