当前位置: X-MOL 学术IEEE Trans. Wirel. Commun. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Max-Min Fair Beamforming for Cooperative Multigroup Multicasting with Rate-Splitting
IEEE Transactions on Wireless Communications ( IF 8.9 ) Pub Date : 2021-01-01 , DOI: 10.1109/twc.2020.3024588
Ahmet Zahid Yalcin , Yavuz Yapici

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.

中文翻译:

具有速率分割的协作多组组播的最大-最小公平波束成形

同时大量访问相同多媒体内容的需求是人口密集的城市地区下一代蜂窝网络面临的一项重大挑战。内容感知多播传输策略为涉及许多移动用户试图获取相同数据的此类用例提供了有希望的解决方案。在这项工作中,我们考虑具有公共消息(例如,多媒体内容)的多组多播传输,其中不同的多播组与其私有多播消息一起感兴趣。我们进一步假设中继帮助蜂窝基站 (BS) 向经历高路径损耗和/或阻塞的用户传播多播内容。我们提出了叠加和级联编码方案,分别用 SC 和 CC 表示,以传输公共和私有多播消息。为了最大化最大最小公平 (MMF) 率,我们设计了一种新颖的低复杂度交替优化算法来计算传输和中继预编码器。我们还提出了 SC 和 CC 方案的速率分割 (RS) 替代方案以及迭代算法,以推导出专用的传输和中继预编码器,从而最大化 MMF 速率。我们严格评估了所提出的传输方案和预编码器的性能,并验证了基于 RS 的方案在过载情况下的优越性,而不会随着信噪比的增加而出现任何饱和。我们还提出了 SC 和 CC 方案的速率分割 (RS) 替代方案以及迭代算法,以推导出专用的传输和中继预编码器,从而最大化 MMF 速率。我们严格评估了所提出的传输方案和预编码器的性能,并验证了基于 RS 的方案在过载情况下的优越性,而不会随着信噪比的增加而出现任何饱和。我们还提出了 SC 和 CC 方案的速率分割 (RS) 替代方案以及迭代算法,以推导出专用的传输和中继预编码器,从而最大化 MMF 速率。我们严格评估了所提出的传输方案和预编码器的性能,并验证了基于 RS 的方案在过载情况下的优越性,而不会随着信噪比的增加而出现任何饱和。
更新日期:2021-01-01
down
wechat
bug