Rate Splitting for Multi-group Multicasting with a Common Message
Ahmet Zahid Yalcin, Melda Yuksel, Bruno Clerckx

TL;DR
This paper proposes a rate-splitting approach for multi-group multicasting with a common message, improving fairness and performance in overloaded systems by dividing messages into private and common parts.
Contribution
It introduces a novel rate-splitting scheme that combines private and common message parts into a super common message for enhanced multicasting performance.
Findings
RS achieves significant fairness gains in overloaded systems.
The proposed method outperforms traditional schemes in simulations.
Super common message approach improves multicast efficiency.
Abstract
In this letter, precoding for max-min fairness (MMF) for multi-group multicasting with a common message is studied. The MMF problem is converted into a weighted mean square error minimization problem. A rate-splitting solution is proposed. In rate-splitting, multicast messages for each group are divided into private and common parts, and these common parts, together with the original common message are combined as a \emph{super common} message. This super common message is superposed on or concatenated to the private multicast data vector, or it is transmitted via a mixed scheme. Simulations show that RS demonstrates significant gains especially in overloaded systems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
