pith. sign in

arxiv: 1211.1969 · v1 · pith:YNHLDV7Hnew · submitted 2012-11-08 · 💻 cs.IT · math.IT

Fast Converging Algorithm for Weighted Sum Rate Maximization in Multicell MISO Downlink

classification 💻 cs.IT math.IT
keywords weightedalgorithmdownlinkproblemratefastknownmaximization
0
0 comments X
read the original abstract

The problem of maximizing weighted sum rates in the downlink of a multicell environment is of considerable interest. Unfortunately, this problem is known to be NP-hard. For the case of multi-antenna base stations and single antenna mobile terminals, we devise a low complexity, fast and provably convergent algorithm that locally optimizes the weighted sum rate in the downlink of the system. In particular, we derive an iterative second-order cone program formulation of the weighted sum rate maximization problem. The algorithm converges to a local optimum within a few iterations. Superior performance of the proposed approach is established by numerically comparing it to other known solutions.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.