期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 60, 期 5, 页码 2508-2523出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2012.2184099
关键词
Branch-reduce-and-bound; dynamic cooperation clusters; fairness-profile; Network MIMO; optimal resource allocation; performance region; worst-case robustness
资金
- European Research Council under the European Community [228044]
The performance of multiuser systems is both difficult to measure fairly and to optimize. Most resource allocation problems are nonconvex and NP-hard, even under simplifying assumptions such as perfect channel knowledge, homogeneous channel properties among users, and simple power constraints. We establish a general optimization framework that systematically solves these problems to global optimality. The proposed branch-reduce-and-bound (BRB) algorithm handles general multicell downlink systems with single-antenna users, multiantenna transmitters, arbitrary quadratic power constraints, and robustness to channel uncertainty. A robust fairness-profile optimization (RFO) problem is solved at each iteration, which is a quasiconvex problem and a novel generalization of max-min fairness. The BRB algorithm is computationally costly, but it shows better convergence than the previously proposed outer polyblock approximation algorithm. Our framework is suitable for computing benchmarks in general multicell systems with or without channel uncertainty. We illustrate this by deriving and evaluating a zero-forcing solution to the general problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据