{"title":"超密集c - ran的联合前传和组播波束形成","authors":"Fangqing Tan, Peiran Wu, M. Jiang, Minghua Xia","doi":"10.1109/iccc52777.2021.9580223","DOIUrl":null,"url":null,"abstract":"This work investigates multicast transmission in ultra-dense cloud radio access networks (C-RANs) with wireless fronthaul. To maximize the weighted sum rate (WSR) of multicast services, joint beamforming for fronthaul and access links are designed, subject to the constraints of fronthaul capacity and transmit powers of small base stations and central processor. The formulated optimization problem is however neither smooth nor convex. For ease of mathematical tractability, the smooth and successive convex approximations are exploited to transform the original problem into a sequence of convex problems, and then a first-order algorithm with low computational complexity is developed to find the optimal solution. Numerical results demonstrate that the proposed first-order algorithm can achieve almost the same WSR as that of traditional second-order approaches yet with much lower computational complexity.","PeriodicalId":425118,"journal":{"name":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Joint Fronthaul and Multicast Beamforming for Ultra-Dense C-RANs\",\"authors\":\"Fangqing Tan, Peiran Wu, M. Jiang, Minghua Xia\",\"doi\":\"10.1109/iccc52777.2021.9580223\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This work investigates multicast transmission in ultra-dense cloud radio access networks (C-RANs) with wireless fronthaul. To maximize the weighted sum rate (WSR) of multicast services, joint beamforming for fronthaul and access links are designed, subject to the constraints of fronthaul capacity and transmit powers of small base stations and central processor. The formulated optimization problem is however neither smooth nor convex. For ease of mathematical tractability, the smooth and successive convex approximations are exploited to transform the original problem into a sequence of convex problems, and then a first-order algorithm with low computational complexity is developed to find the optimal solution. Numerical results demonstrate that the proposed first-order algorithm can achieve almost the same WSR as that of traditional second-order approaches yet with much lower computational complexity.\",\"PeriodicalId\":425118,\"journal\":{\"name\":\"2021 IEEE/CIC International Conference on Communications in China (ICCC)\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE/CIC International Conference on Communications in China (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/iccc52777.2021.9580223\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE/CIC International Conference on Communications in China (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/iccc52777.2021.9580223","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Joint Fronthaul and Multicast Beamforming for Ultra-Dense C-RANs
This work investigates multicast transmission in ultra-dense cloud radio access networks (C-RANs) with wireless fronthaul. To maximize the weighted sum rate (WSR) of multicast services, joint beamforming for fronthaul and access links are designed, subject to the constraints of fronthaul capacity and transmit powers of small base stations and central processor. The formulated optimization problem is however neither smooth nor convex. For ease of mathematical tractability, the smooth and successive convex approximations are exploited to transform the original problem into a sequence of convex problems, and then a first-order algorithm with low computational complexity is developed to find the optimal solution. Numerical results demonstrate that the proposed first-order algorithm can achieve almost the same WSR as that of traditional second-order approaches yet with much lower computational complexity.