{"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}
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.