Scalable coordinated uplink processing in cloud radio access networks

Congmin Fan, Y. Zhang, Xiaojun Yuan
{"title":"Scalable coordinated uplink processing in cloud radio access networks","authors":"Congmin Fan, Y. Zhang, Xiaojun Yuan","doi":"10.1109/GLOCOM.2014.7037365","DOIUrl":null,"url":null,"abstract":"Featured by centralized processing and cloud based infrastructure, Cloud Radio Access Network (C-RAN) is a promising solution to achieve an unprecedented system capacity in future wireless cellular networks. The huge capacity gain mainly comes from the centralized and coordinated signal processing at the cloud server. However, full-scale coordination in a large-scale C-RAN requires the processing of very large channel matrices, leading to high computational complexity and channel estimation overhead. To resolve this challenge, we show in this paper that the channel matrices can be greatly sparsified without substantially compromising the system capacity. Through rigorous analysis, we derive a simple threshold-based channel matrix sparsification approach. Based on this approach, for reasonably large networks, the non-zero entries in the channel matrix can be reduced to a very low percentage (say 0.13% ~ 2%) by compromising only 5% of SINR. This means each RRH only needs to obtain the CSI of a small number of closest users, resulting in a significant reduction in the channel estimation overhead. On the other hand, the high sparsity of the channel matrix allows us to design detection algorithms that are scalable in the sense that the average computational complexity per user does not grow with the network size.","PeriodicalId":6492,"journal":{"name":"2014 IEEE Global Communications Conference","volume":"112 1","pages":"3591-3596"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Global Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2014.7037365","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Featured by centralized processing and cloud based infrastructure, Cloud Radio Access Network (C-RAN) is a promising solution to achieve an unprecedented system capacity in future wireless cellular networks. The huge capacity gain mainly comes from the centralized and coordinated signal processing at the cloud server. However, full-scale coordination in a large-scale C-RAN requires the processing of very large channel matrices, leading to high computational complexity and channel estimation overhead. To resolve this challenge, we show in this paper that the channel matrices can be greatly sparsified without substantially compromising the system capacity. Through rigorous analysis, we derive a simple threshold-based channel matrix sparsification approach. Based on this approach, for reasonably large networks, the non-zero entries in the channel matrix can be reduced to a very low percentage (say 0.13% ~ 2%) by compromising only 5% of SINR. This means each RRH only needs to obtain the CSI of a small number of closest users, resulting in a significant reduction in the channel estimation overhead. On the other hand, the high sparsity of the channel matrix allows us to design detection algorithms that are scalable in the sense that the average computational complexity per user does not grow with the network size.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
云无线接入网络中可扩展的协调上行处理
云无线接入网(C-RAN)具有集中处理和基于云的基础设施的特点,是未来无线蜂窝网络中实现前所未有的系统容量的一种有前途的解决方案。巨大的容量增益主要来自于云服务器上集中协调的信号处理。然而,大规模C-RAN中的全尺寸协调需要处理非常大的信道矩阵,导致高计算复杂度和信道估计开销。为了解决这一挑战,我们在本文中表明,通道矩阵可以在不实质性损害系统容量的情况下大大稀疏化。通过严格的分析,我们推导出一种简单的基于阈值的信道矩阵稀疏化方法。基于这种方法,对于相当大的网络,通过仅牺牲5%的SINR,信道矩阵中的非零条目可以减少到非常低的百分比(例如0.13% ~ 2%)。这意味着每个RRH只需要获得少数最接近用户的CSI,从而大大减少了信道估计开销。另一方面,通道矩阵的高稀疏性允许我们设计可扩展的检测算法,因为每个用户的平均计算复杂性不会随着网络规模的增长而增长。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Power efficient uplink resource allocation in LTE networks under delay QoS constraints Harvest-and-jam: Improving security for wireless energy harvesting cooperative networks Two-way relaying networks with wireless power transfer: Policies design and throughput analysis Resource management in cognitive opportunistic access femtocells with imperfect spectrum sensing Optimizing rule placement in software-defined networks for energy-aware routing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1