An achievability scheme for downlink multicell processing with finite backhaul capacity: The general case

Xiao-xin Yi, Nan Liu
{"title":"An achievability scheme for downlink multicell processing with finite backhaul capacity: The general case","authors":"Xiao-xin Yi, Nan Liu","doi":"10.1109/WCSP.2015.7341288","DOIUrl":null,"url":null,"abstract":"In the general scenario of downlink multicell processing, we propose an achievability scheme for the case where the capacity of the backhaul links are limited. The achievability scheme proposed generalizes our earlier work of 2 base stations and 2 mobile users to an arbitrary number of base stations and users. Through numerical results, we demonstrate through example that in the medium range of finite backhaul capacity, our scheme outperforms other known achievability schemes.","PeriodicalId":164776,"journal":{"name":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Wireless Communications & Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2015.7341288","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In the general scenario of downlink multicell processing, we propose an achievability scheme for the case where the capacity of the backhaul links are limited. The achievability scheme proposed generalizes our earlier work of 2 base stations and 2 mobile users to an arbitrary number of base stations and users. Through numerical results, we demonstrate through example that in the medium range of finite backhaul capacity, our scheme outperforms other known achievability schemes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
有限回程容量下行多单元处理的可实现方案:一般情况
在下行链路多单元处理的一般情况下,针对回程链路容量有限的情况,提出了一种可实现性方案。提出的可实现性方案将我们早期的2个基站和2个移动用户的工作推广到任意数量的基站和用户。通过数值结果,我们通过实例证明,在有限回程容量的中等范围内,我们的方案优于其他已知的可达性方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Blind recognition of BCH code based on Galois field fourier transform Secrecy outage on transmit antenna selection/maximal ratio combining in MIMO cognitive radio networks A modified distributed target localization scheme in the presence of Byzantine attack Outage performance analysis of amplify-and-forward cognitive relay networks with partial relay selection Performance comparison of subharnomic and Zernike polynomials method for compensation of low-frequency components in FFT-based Von Karman phase screen
×
引用
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