Rights statement: ©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Accepted author manuscript, 102 KB, PDF document
Final published version
Research output: Contribution to Journal/Magazine › Letter › peer-review
Research output: Contribution to Journal/Magazine › Letter › peer-review
}
TY - JOUR
T1 - Fairness of user clustering in MIMO non-orthogonal multiple access systems
AU - Liu, Yuanwei
AU - Elkashlan, Maged
AU - Ding, Zhiguo
AU - Karagiannidis, George K.
N1 - ©2016 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
PY - 2016/7
Y1 - 2016/7
N2 - In this letter, a downlink multiple-input-multiple-output non-orthogonal multiple access scenario is considered. We investigate a dynamic user clustering problem from a fairness perspective. In order to solve this optimization problem, three sub-optimal algorithms, namely, top-down A, top-down B, and bottom up, are proposed to realize the different tradeoffs of complexity and throughput of the worst user. In addition, for each given user clustering case, we optimize the power allocation coefficients for the users in each cluster by adopting a bisection search-based algorithm. Numerical results show that the proposed algorithms can lower the complexity with an acceptable degradation on the throughput compared with the exhaustive search method. It is worth noting that the top-down B algorithm can achieve a good tradeoff between the complexity and the throughput among the three proposed algorithms.
AB - In this letter, a downlink multiple-input-multiple-output non-orthogonal multiple access scenario is considered. We investigate a dynamic user clustering problem from a fairness perspective. In order to solve this optimization problem, three sub-optimal algorithms, namely, top-down A, top-down B, and bottom up, are proposed to realize the different tradeoffs of complexity and throughput of the worst user. In addition, for each given user clustering case, we optimize the power allocation coefficients for the users in each cluster by adopting a bisection search-based algorithm. Numerical results show that the proposed algorithms can lower the complexity with an acceptable degradation on the throughput compared with the exhaustive search method. It is worth noting that the top-down B algorithm can achieve a good tradeoff between the complexity and the throughput among the three proposed algorithms.
U2 - 10.1109/LCOMM.2016.2559459
DO - 10.1109/LCOMM.2016.2559459
M3 - Letter
VL - 20
SP - 1465
EP - 1468
JO - IEEE Communications Letters
JF - IEEE Communications Letters
SN - 1089-7798
IS - 7
ER -