论文标题

一种新型的频谱高效上行链路混合域NOMA系统

A Novel Spectrally-Efficient Uplink Hybrid-Domain NOMA System

论文作者

Quan, Chen, Yadav, Animesh, Geng, Baocheng, Varshney, Pramod K., Poor, H. Vincent

论文摘要

本文提出了一种新型混合域(HD)非正交多访问(NOMA)方法,以支持比最近提出的代码域NOMA方法(即稀疏代码多重访问(SCMA))支持更多上行链路用户的方法。 HD-NOMA通过将用户聚集在小路径损失(强)和较大的路径损失(弱)组中,结合了代码域和功率域NOMA方案。两组使用连续的干扰取消进行解码,而在组中,使用消息传递算法对用户进行解码。为了进一步提高系统的性能,在用户服务质量约束下提出了光谱效率最大化问题,该约束将动力和子载波分配给用户。这个问题是非凸,并且具有稀疏性约束。交替的优化过程用于迭代解决。我们采用连续的凸近似,并重新加权$ \ ell_1 $最小化方法分别处理非凸性和稀疏性约束。通过数值模拟评估了所提出的HD-NOMA的性能,并与常规的SCMA方案进行了比较。结果表明,HD-Noma在增加上行链路用户数量方面的潜力。

This paper proposes a novel hybrid-domain (HD) non-orthogonal multiple access (NOMA) approach to support a larger number of uplink users than the recently proposed code-domain NOMA approach, i.e., sparse code multiple access (SCMA). HD-NOMA combines the code-domain and power-domain NOMA schemes by clustering the users in small path loss (strong) and large path loss (weak) groups. The two groups are decoded using successive interference cancellation while within the group users are decoded using the message passing algorithm. To further improve the performance of the system, a spectral-efficiency maximization problem is formulated under a user quality-of-service constraint, which dynamically assigns power and subcarrier to the users. The problem is non-convex and has sparsity constraints. The alternating optimization procedure is used to solve it iteratively. We apply successive convex approximation and reweighted $\ell_1$ minimization approaches to deal with the non-convexity and sparsity constraints, respectively. The performance of the proposed HD-NOMA is evaluated and compared with the conventional SCMA scheme through numerical simulation. The results show the potential of HD-NOMA in increasing the number of uplink users.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源