{"title":"有限回程容量下行多单元处理的可实现方案:一般情况","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":"{\"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}","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}
An achievability scheme for downlink multicell processing with finite backhaul capacity: The general case
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.