Fairness of User Clustering in MIMO Non-Orthogonal Multiple Access Systems
Fairness of User Clustering in MIMO Non-Orthogonal Multiple Access Systems
复制标题
DOI：
10.1109/lcomm.2016.2559459
复制
发表时间：
2016-07-01
期刊：
影响因子：
--
通讯作者：
Karagiannidis, George K.
中科院分区：
文献类型：
--
作者：
Liu, Yuanwei;Elkashlan, Maged;Karagiannidis, George K.
在这封信中，下行链路多输入多输出非正交多址接入的情况下被认为是。我们从公平的角度研究了动态用户聚类问题。为了解决这一优化问题，提出了自顶向下A、自顶向下B和自底向上三种次优算法，实现了复杂度和最差用户吞吐量的不同折衷。此外，对于每一个给定的用户聚类的情况下，我们优化的功率分配系数，在每个集群中的用户采用二分搜索为基础的算法。数值结果表明，与穷举搜索方法相比，所提出的算法可以降低复杂度，并在可接受的吞吐量下降。值得注意的是，自顶向下的B算法可以实现一个很好的折衷之间的复杂度和吞吐量的三个算法。
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.