Efficient algorithms for sum rate maximization in fronthaul-constrained C-RANs
Nguyen, Kien-Giang; Vu, Quang-Doanh; Tran, Le-Nam; Juntti, Markku (2019-10-21)
K. Nguyen, Q. Vu, L. Tran and M. Juntti, "Efficient Algorithms for Sum Rate Maximization in Fronthaul-Constrained C-RANs," 2019 16th International Symposium on Wireless Communication Systems (ISWCS), Oulu, Finland, 2019, pp. 304-308. doi: 10.1109/ISWCS.2019.8877096
© 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
https://rightsstatements.org/vocab/InC/1.0/
https://urn.fi/URN:NBN:fi-fe2019121848683
Tiivistelmä
Abstract
We consider downlink transmission of a fronthaul-constrained cloud radio access network. Our aim is to maximize the system sum data rate via jointly designing beamforming and user association. The problem is basically a mixed integer non-convex programs for which a global solution requires a prohibitively high computational effort. The focus is thus on efficient solutions capable of achieving the near optimal performance with low complexity. To this end, we transform the design problem into continuous programs by two approaches: penalty and sparse approximation methods. The resulting continuous nonconvex problems are then solved by the successive convex approximation framework. Numerical results indicate that the proposed methods are near-optimal, and outperform existing suboptimal methods in terms of achieved performances and computational complexity.
Kokoelmat
- Avoin saatavuus [31657]