论文标题

MMWave-Noma系统中具有用户解码功能约束的用户聚类

User Clustering in mmWave-NOMA Systems with User Decoding Capability Constraints for B5G Networks

论文作者

Rajasekaran, Aditya S., Maraqa, Omar, Sokun, Hamza U., Yanikomeroglu, Halim, Al-Ahmadi, Saad

论文摘要

本文提出了一个毫米波 - 诺马(MMWave-noma)系统,该系统考虑了最终用户信号处理能力,这是一个重要的实际考虑。在下行链路(DL)方向上实施NOMA需要在用户终端执行连续的干扰取消(SIC),这是以额外复杂性为代价的。在NOMA中,最弱的用户只需要解码自己的信号,而最强大的用户必须在SIC过程中解码所有其他用户的信号。因此,用户为DL NOMA执行SIC所需的附加实现复杂性取决于其在SIC解码顺序中的位置。除了第五代(B5G)的通信系统以外,还有望支持各种最终用户设备,每个设备都具有自己的处理能力。我们设想了一个系统,用户将其SIC解码功能报告给基站(BS),即,其他用户的数量信号是用户能够在SIC过程中解码的。我们通过将其分解为用户聚类和订购问题(UCOP),然后将其分解为功率分配问题,从而研究了速率最大化问题。我们提出了NOMA最小精确覆盖(NOMA-MEC)启发式算法,该算法将UCOP转换为群集最小化问题,从衍生的一组有效的群集组合组合后,将SIC解码能力进行了考虑。分析了各种算法和系统参数的NOMA-MEC的复杂性。对于所有具有相同解码功能的用户系统的同质系统,我们表明,这相当于每个集群约束的最大用户数量,并提出较低的复杂性NOMA-Best-Best Beam(Noma-BB)算法。模拟结果表明,与正交多重访问(OMA)和传统NOMA相比,总和率的性能优越。

This paper proposes a millimeter wave-NOMA (mmWave-NOMA) system that takes into account the end-user signal processing capabilities, an important practical consideration. The implementation of NOMA in the downlink (DL) direction requires successive interference cancellation (SIC) to be performed at the user terminals, which comes at the cost of additional complexity. In NOMA, the weakest user only has to decode its own signal, while the strongest user has to decode the signals of all other users in the SIC procedure. Hence, the additional implementation complexity required of the user to perform SIC for DL NOMA depends on its position in the SIC decoding order. Beyond fifth-generation (B5G) communication systems are expected to support a wide variety of end-user devices, each with their own processing capabilities. We envision a system where users report their SIC decoding capability to the base station (BS), i.e., the number of other users signals a user is capable of decoding in the SIC procedure. We investigate the rate maximization problem in such a system, by breaking it down into a user clustering and ordering problem (UCOP), followed by a power allocation problem. We propose a NOMA minimum exact cover (NOMA-MEC) heuristic algorithm that converts the UCOP into a cluster minimization problem from a derived set of valid cluster combinations after factoring in the SIC decoding capability. The complexity of NOMA-MEC is analyzed for various algorithm and system parameters. For a homogeneous system of users that all have the same decoding capabilities, we show that this equates to a simple maximum number of users per cluster constraint and propose a lower complexity NOMA-best beam (NOMA-BB) algorithm. Simulation results demonstrate the performance superiority in terms of sum rate compared to orthogonal multiple access (OMA) and traditional NOMA

扫码加入交流群

加入微信交流群

微信交流群二维码

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