论文标题
优化上行链路合作NOMA中的功率分配和解码顺序
On Optimizing the Power Allocation and the Decoding Order in Uplink Cooperative NOMA
论文作者
论文摘要
在本文中,我们首次研究了两用户上行链路(UL)合作非正交多访问(C-NOMA)基于基于的基于两种用户上行链路(ul)基于基于的蜂窝网络的动力分配和解码顺序。在此过程中,我们制定了一个旨在最大化最低用户可实现率的关节优化问题,这是一个非凸优化问题,很难直接解决。为了解决此问题,提出了基于连续的凸近似(SCA)的迭代算法。数值结果表明,与传统的UL Noma相比,所提出的方案提供了出色的性能。此外,我们证明了在UL C-Noma中,首先在BS上解码遥远的NOMA用户提供了最佳性能。
In this paper, we investigate for the first time the dynamic power allocation and decoding order at the base station (BS) of two-user uplink (UL) cooperative non-orthogonal multiple access (C-NOMA)-based cellular networks. In doing so, we formulate a joint optimization problem aiming at maximizing the minimum user achievable rate, which is a non-convex optimization problem and hard to be directly solved. To tackle this issue, an iterative algorithm based on successive convex approximation (SCA) is proposed. The numerical results reveal that the proposed scheme provides superior performance in comparison with the traditional UL NOMA. In addition, we demonstrated that in UL C-NOMA, decoding the far NOMA user first at the BS provides the best performance.