arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.08313cs.NIcs.ITmath.IT
收藏

非正交多址网络的子信道分配、功率分配和用户调度

Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks

Boya Di, Lingyang Song, Yonghui Li

摘要:

在本文中,我们研究的资源分配和用户调度问题的下行链路非正交多址接入网络中的基站分配频谱和功率资源的一组用户。我们的目标是联合优化的子信道分配和功率分配,以最大限度地提高加权总速率,同时考虑用户的公平性。我们制定的子信道分配问题,相当于一个多对多的双边用户子信道匹配游戏中的用户和子信道被认为是两套球员追求自己的利益。然后,我们提出了一个匹配算法,收敛到双边交换稳定匹配后,有限的迭代次数。因此,提供了一种联合解决方案来迭代地解决子信道分配和功率分配问题。仿真结果表明,所提出的算法大大优于正交多址接入方案和以前的非正交多址接入方案。

英文摘要:

In this paper, we study the resource allocation and user scheduling problem for a downlink nonorthogonal multiple access network where the base station allocates spectrum and power resources to a set of users. We aim to jointly optimize the sub-channel assignment and power allocation to maximize the weighted total sum-rate while taking into account user fairness. We formulate the sub-channel allocation problem as equivalent to a many-to-many two-sided user-subchannel matching game in which the set of users and sub-channels are considered as two sets of players pursuing their own interests. We then propose a matching algorithm which converges to a two-side exchange stable matching after a limited number of iterations. A joint solution is thus provided to solve the sub-channel assignment and power allocation problems iteratively. Simulation results show that the proposed algorithm greatly outperforms the orthogonal multiple access scheme and a previous non-orthogonal multiple access scheme.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑