arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.09179eess.SP
收藏

一种新的频谱有效的上行混合域NOMA系统

A Novel Spectrally-Efficient Uplink Hybrid-Domain NOMA System

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

摘要:

本文提出了一种新的混合域(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.

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

↑