pith. machine review for the scientific record. sign in

arxiv: 1010.4690 · v1 · submitted 2010-10-22 · 💻 cs.IT · math.IT

Recognition: unknown

A convex approximation approach to Weighted Sum Rate Maximization of Multiuser MISO Interference Channel under outage constraints

Authors on Pith no claims yet
classification 💻 cs.IT math.IT
keywords ratemaximizationproblemweightedapproximationconvexmethodoptimization
0
0 comments X
read the original abstract

This paper considers weighted sum rate maximization of multiuser multiple-input single-output interference channel (MISO-IFC) under outage constraints. The outage-constrained weighted sum rate maximization problem is a nonconvex optimization problem and is difficult to solve. While it is possible to optimally deal with this problem in an exhaustive search manner by finding all the Pareto-optimal rate tuples in the (discretized) outage-constrained achievable rate region, this approach, however, suffers from a prohibitive computational complexity and is feasible only when the number of transmitter-receive pairs is small. In this paper, we propose a convex optimization based approximation method for efficiently handling the outage-constrained weighted sum rate maximization problem. The proposed approximation method consists of solving a sequence of convex optimization problems, and thus can be efficiently implemented by interior-point methods. Simulation results show that the proposed method can yield near-optimal 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.