云蜂窝网络中上行链路性能的有限复杂度优化

S. Govindasamy, I. Bergel
{"title":"云蜂窝网络中上行链路性能的有限复杂度优化","authors":"S. Govindasamy, I. Bergel","doi":"10.1109/SPAWC.2018.8445917","DOIUrl":null,"url":null,"abstract":"We consider a cooperative cellular network where the signal from a mobile is detected jointly by base stations close to it using a minimum-mean-square-error (MMSE) estimator. We assume a network where different numbers of cooperating base stations can be used for the detection of each mobile. We also assume that all signals are delivered to a processing center which has limited computational capabilities. We present an upper bound on the achievable weighted sum rate for a given computational complexity. We also derive a simple and practical optimization scheme that is based on asymptotic results for the spectral efficiency of a typical link in a Poison point process model. The derived scheme results in a computational savings over schemes that use a fixed number of cooperating base stations for each mobile. The suggested scheme also enables an easy tuning of the computational complexity, according to system needs and energy requirements.","PeriodicalId":240036,"journal":{"name":"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)","volume":"32 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Limited Complexity Optimization of the Uplink Performance in Cloud Cellular Networks\",\"authors\":\"S. Govindasamy, I. Bergel\",\"doi\":\"10.1109/SPAWC.2018.8445917\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a cooperative cellular network where the signal from a mobile is detected jointly by base stations close to it using a minimum-mean-square-error (MMSE) estimator. We assume a network where different numbers of cooperating base stations can be used for the detection of each mobile. We also assume that all signals are delivered to a processing center which has limited computational capabilities. We present an upper bound on the achievable weighted sum rate for a given computational complexity. We also derive a simple and practical optimization scheme that is based on asymptotic results for the spectral efficiency of a typical link in a Poison point process model. The derived scheme results in a computational savings over schemes that use a fixed number of cooperating base stations for each mobile. The suggested scheme also enables an easy tuning of the computational complexity, according to system needs and energy requirements.\",\"PeriodicalId\":240036,\"journal\":{\"name\":\"2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)\",\"volume\":\"32 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"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.8445917\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","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.8445917","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们考虑一个合作蜂窝网络,其中来自移动设备的信号由靠近它的基站使用最小均方误差(MMSE)估计器共同检测。我们假设有一个网络,其中可以使用不同数量的合作基站来检测每个移动设备。我们还假设所有的信号都被传送到一个计算能力有限的处理中心。对于给定的计算复杂度,我们给出了可实现的加权和速率的上界。我们还推导了一个简单实用的优化方案,该方案基于一个典型环节的谱效率的渐近结果。所导出的方案比为每个移动设备使用固定数量的合作基站的方案节省了计算量。建议的方案还可以根据系统需求和能源需求轻松调整计算复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Limited Complexity Optimization of the Uplink Performance in Cloud Cellular Networks
We consider a cooperative cellular network where the signal from a mobile is detected jointly by base stations close to it using a minimum-mean-square-error (MMSE) estimator. We assume a network where different numbers of cooperating base stations can be used for the detection of each mobile. We also assume that all signals are delivered to a processing center which has limited computational capabilities. We present an upper bound on the achievable weighted sum rate for a given computational complexity. We also derive a simple and practical optimization scheme that is based on asymptotic results for the spectral efficiency of a typical link in a Poison point process model. The derived scheme results in a computational savings over schemes that use a fixed number of cooperating base stations for each mobile. The suggested scheme also enables an easy tuning of the computational complexity, according to system needs and energy requirements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信