ShanghaiTech University Knowledge Management System
Rate Splitting Multiple Access-Aided MISO Visible Light Communications | |
2022-10-22 | |
会议录名称 | 2022 INTERNATIONAL SYMPOSIUM ON WIRELESS COMMUNICATION SYSTEMS (ISWCS)
![]() |
发表状态 | 已发表 |
DOI | 10.1109/ISWCS56560.2022.9940414 |
摘要 | In this paper, we focus on the optimal beamformer design for rate splitting multiple access (RSMA)-aided multiple-input single-output (MISO) visible light communication (VLC) networks. First, we derive the closed-form lower bounds of the achievable rate of each user, which are the first theoretical bound of achievable rate for RSMA-aided VLC networks. Second, we investigate the optimal beamformer design for RSMA-aided VLC networks to maximize the sum rate under the optical and electrical power constraints. Since this optimal problem is non-convex, a concave-convex procedure (CCCP)-based iterative algorithm is proposed to approximate the non-convex term by the convex lower bound at each iteration. Thus, the optimal beamformer design problem can be solved iteratively until convergence, and a high-quality suboptimal solution can be obtained. In addition, we show that the proposed algorithms of RSMA-aided networks can achieve superior performance compared with space-division multiple access (SDMA) and non-orthogonal multiple access (NOMA). |
关键词 | Visible light communication rate splitting multiple access beamformer design |
会议地点 | Hangzhou, China |
会议日期 | 19-22 Oct. 2022 |
URL | 查看原文 |
收录类别 | EI |
来源库 | IEEE |
引用统计 | 正在获取...
|
文献类型 | 会议论文 |
条目标识符 | https://kms.shanghaitech.edu.cn/handle/2MSLDSTB/251927 |
专题 | 信息科学与技术学院_PI研究组_吴幼龙组 |
作者单位 | 1.Sch. of Inform. and Cont. Eng., China University of Mining and Technology, Xuzhou; 221116, China; 2.School of Information Science and Technology, ShanghaiTech University, Shanghai; 201210, China |
推荐引用方式 GB/T 7714 | Ma, Shuai,Zhang, Guanjie,Zhang, Zhi,et al. Rate Splitting Multiple Access-Aided MISO Visible Light Communications[C],2022. |
条目包含的文件 | ||||||
文件名称/大小 | 文献类型 | 版本类型 | 开放类型 | 使用许可 |
修改评论
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。