论文标题

Max-Min Fair-eagrighting用于合作多群的合作式多播和速率分类

Max-Min Fair Beamforming for Cooperative Multigroup Multicasting with Rate-Splitting

论文作者

Yalcin, Ahmet Zahid, Yapici, Yavuz

论文摘要

同时大量访问相同多媒体内容的需求是对密集包装的城市地区下一代蜂窝网络的一个主要挑战。内容感知到的多播传输策略为许多试图获取相同数据的移动用户提供了有希望的解决方案。在这项工作中,我们考虑使用通用消息(例如多媒体内容)的多群多播传输,其中不同的多播组以及其私人多播消息感兴趣。我们进一步假设继电器有助于蜂窝基站(BS)向经历高路径损失和/或阻塞的用户传播多播内容。我们提出了叠加和串联编码方案,分别用SC和CC表示,以传输常见和私人的多播消息。为了最大程度地提高Max-Min Fair(MMF)速率,我们设计了一种新型的低复杂性交替优化算法来计算传输和继电器预编码器。我们还提出了SC和CC方案的速率分解(RS)替代方案以及迭代算法,以得出专用的传输和继电器预编码,以最大程度地提高MMF速率。我们严格评估提出的传输方案和预编码器的性能,并在过载的场景中验证基于RS的方案的优势,而没有任何饱和,而信噪比增加了。

The demand of massive access to the same multimedia content at the same time is one major challenge for next-generation cellular networks in densely-packed urban areas. The content-aware multicast transmission strategies provide promising solutions to such use cases involving many mobile users trying to fetch the same data. In this work, we consider multigroup multicast transmission with a common message (e.g., multimedia content), in which different multicast groups are interested along with their private multicast messages. We further assume that a relay helps the cellular base station (BS) disseminate multicast content to the users experiencing high path loss and/or blockage. We propose superposition and concatenated coding schemes, denoted by SC and CC, respectively, to transmit the common and private multicast messages. In order to maximize max-min fair (MMF) rates, we design a novel low-complexity alternating-optimization algorithm to compute transmit and relay precoders. We also propose rate-splitting (RS) alternatives of SC and CC schemes together with an iterative algorithm to derive dedicated transmit and relay precoders so as to maximize MMF rates. We rigorously evaluate the performance of the proposed transmission schemes and precoders, and verify the superiority of RS-based schemes in overloaded scenarios without any saturation with increasing signal-to-noise ratio.

扫码加入交流群

加入微信交流群

微信交流群二维码

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