English

Robust Max-Min Fair Beamforming Design for Rate Splitting Multiple Access-aided Visible Light Communications

Information Theory 2024-11-28 v2 Signal Processing math.IT

Abstract

This paper addresses the robust beamforming design for rate splitting multiple access (RSMA)-aided visible light communication (VLC) networks with imperfect channel state information at the transmitter (CSIT). In particular, we first derive the theoretical lower bound for the channel capacity of RSMA-aided VLC networks. Then we investigate the beamforming design to solve the max-min fairness (MMF) problem of RSMA-aided VLC networks under the practical optical power constraint and electrical power constraint while considering the practical imperfect CSIT scenario. To address the problem, we propose a constrained-concave-convex programming (CCCP)-based beamforming design algorithm which exploits semidefinite relaxation (SDR) technique and a penalty method to deal with the rank-one constraint caused by SDR. Numerical results show that the proposed robust beamforming design algorithm for RSMA-aided VLC network achieves a superior performance over the existing ones for space-division multiple access (SDMA) and non-orthogonal multiple access (NOMA).

Keywords

Cite

@article{arxiv.2411.17056,
  title  = {Robust Max-Min Fair Beamforming Design for Rate Splitting Multiple Access-aided Visible Light Communications},
  author = {Zhengqing Qiu and Yijie Mao and Shuai Ma and Bruno Clerckx},
  journal= {arXiv preprint arXiv:2411.17056},
  year   = {2024}
}
R2 v1 2026-06-28T20:12:32.476Z