Interference Mitigation Via Rate-Splitting in Cloud Radio Access Networks

A. Ahmad, H. Dahrouj, A. Chaaban, A. Sezgin, Mohamed-Slim Alouini
{"title":"Interference Mitigation Via Rate-Splitting in Cloud Radio Access Networks","authors":"A. Ahmad, H. Dahrouj, A. Chaaban, A. Sezgin, Mohamed-Slim Alouini","doi":"10.1109/SPAWC.2018.8445778","DOIUrl":null,"url":null,"abstract":"Cloud-radio access networks (C-RAN) help overcoming the scarcity of radio resources by enabling dense deployment of base-stations (BSs), and connecting them to a central-processor (CP). This paper considers the downlink of a C-RAN, and evaluates rate-splitting (RS) and common-message decoding techniques, as a means to enable large-scale interference management. To this end, the paper proposes splitting the message of each user at the CP into a private part decodable at one user, and a common part decodable at a subset of users for the sole purpose of interference mitigation. The paper then focuses on maximizing the weighted sum-rate subject to backhaul capacity and transmission power constraints, so as to determine the RS mode of each user, and the associated beamforming vectors. The paper proposes solving such a complicated non-convex optimization problem using an inner-convex approximation approach, which guarantees achieving a stationary solution to the problem. Numerical results show that the proposed method provides significant gain compared to classical interference mitigation techniques that do not rely on RS and common message decoding.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPAWC.2018.8445778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

Abstract

Cloud-radio access networks (C-RAN) help overcoming the scarcity of radio resources by enabling dense deployment of base-stations (BSs), and connecting them to a central-processor (CP). This paper considers the downlink of a C-RAN, and evaluates rate-splitting (RS) and common-message decoding techniques, as a means to enable large-scale interference management. To this end, the paper proposes splitting the message of each user at the CP into a private part decodable at one user, and a common part decodable at a subset of users for the sole purpose of interference mitigation. The paper then focuses on maximizing the weighted sum-rate subject to backhaul capacity and transmission power constraints, so as to determine the RS mode of each user, and the associated beamforming vectors. The paper proposes solving such a complicated non-convex optimization problem using an inner-convex approximation approach, which guarantees achieving a stationary solution to the problem. Numerical results show that the proposed method provides significant gain compared to classical interference mitigation techniques that do not rely on RS and common message decoding.
云无线接入网中基于速率分割的干扰抑制
云无线接入网络(C-RAN)通过密集部署基站(BSs)并将其连接到中央处理器(CP),帮助克服无线电资源的稀缺。本文考虑了C-RAN的下行链路,并评估了速率分割(RS)和共消息解码技术,作为实现大规模干扰管理的一种手段。为此,本文提出将CP上每个用户的消息拆分为可在单个用户处可解码的私有部分和可在一组用户处可解码的公共部分,以达到减少干扰的目的。然后重点研究在回程容量和发射功率约束下加权和速率的最大化,从而确定每个用户的RS模式,以及相关的波束形成矢量。本文提出用内凸逼近方法求解这类复杂的非凸优化问题,保证了问题的平稳解。数值结果表明,与不依赖RS和普通报文解码的经典干扰抑制技术相比,该方法具有显著的增益。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信