计算机科学
波束赋形
电信线路
分式程序设计
数学优化
调度(生产过程)
多输入多输出
算法
贪婪算法
二次规划
蜂窝网络
地铁列车时刻表
无线接入网
迭代法
最优化问题
集合(抽象数据类型)
无线网络
计算复杂性理论
资源配置
块(置换群论)
作业车间调度
预编码
干扰(通信)
无线
线性规划
解算器
空分多址
作者
Ahmad Ali Khan,Raviraj Adve,Wei Yu
标识
DOI:10.1109/twc.2020.2990176
摘要
Optimizing the sum-log-utility for the downlink of multi-frequency band, multiuser, multiantenna networks requires joint solutions to the associated beamforming and user scheduling problems through the use of cloud radio access network (CRAN) architecture; optimizing such a network is, however, non-convex and NP-hard. In this paper, we present a novel iterative beamforming and scheduling strategy based on fractional programming and the Hungarian algorithm. The beamforming strategy allows us to iteratively maximize the chosen objective function in a fashion similar to block coordinate ascent. Furthermore, based on the crucial insight that, in the downlink, the interference pattern remains fixed for a given set of beamforming weights, we use the Hungarian algorithm as an efficient approach to optimally schedule users for the given set of beamforming weights. Specifically, this approach allows us to select the best subset of users (amongst the larger set of all available users). Our simulation results show that, in terms of average sum-log-utility, as well as sum-rate, the proposed scheme substantially outperforms both the state-of-the-art multicell weighted minimum mean-squared error (WMMSE) and greedy proportionally fair WMMSE schemes, as well as standard interior-point and sequential quadratic solvers. Importantly, our proposed scheme is also far more computationally efficient than the multicell WMMSE scheme.
科研通智能强力驱动
Strongly Powered by AbleSci AI