Uplink pilot allocation for multi-cell massive MIMO systems

Wanming Hao, Osamu Muta, Haris Gacanin, Hiroshi Furukawa

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)373-380
Number of pages8
JournalIEICE Transactions on Communications
Issue number2
DOIs
Publication statusPublished - Feb 1 2019

Fingerprint

Contamination

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Uplink pilot allocation for multi-cell massive MIMO systems. / Hao, Wanming; Muta, Osamu; Gacanin, Haris; Furukawa, Hiroshi.

In: IEICE Transactions on Communications, No. 2, 01.02.2019, p. 373-380.

Research output: Contribution to journalArticle

Hao, Wanming ; Muta, Osamu ; Gacanin, Haris ; Furukawa, Hiroshi. / Uplink pilot allocation for multi-cell massive MIMO systems. In: IEICE Transactions on Communications. 2019 ; No. 2. pp. 373-380.
@article{f12056505cbf4226954d4ba731ac0566,
title = "Uplink pilot allocation for multi-cell massive MIMO systems",
abstract = "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.",
author = "Wanming Hao and Osamu Muta and Haris Gacanin and Hiroshi Furukawa",
year = "2019",
month = "2",
day = "1",
doi = "10.1587/transcom.2017EBP3312",
language = "English",
pages = "373--380",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "2",

}

TY - JOUR

T1 - Uplink pilot allocation for multi-cell massive MIMO systems

AU - Hao, Wanming

AU - Muta, Osamu

AU - Gacanin, Haris

AU - Furukawa, Hiroshi

PY - 2019/2/1

Y1 - 2019/2/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85061568459&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85061568459&partnerID=8YFLogxK

U2 - 10.1587/transcom.2017EBP3312

DO - 10.1587/transcom.2017EBP3312

M3 - Article

SP - 373

EP - 380

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 2

ER -