An Efficient Algorithm for Weighted Sum-Rate Maximization in Multicell OFDMA Downlink

Mirza Golam KIBRIA  Hidekazu MURATA  Susumu YOSHIDA  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E97-A   No.1   pp.69-77
Publication Date: 2014/01/01
Online ISSN: 1745-1337
DOI: 10.1587/transfun.E97.A.69
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Wideband Systems)
Category: Resource Allocation
weighted sum-rate maximization,  coordinated linear precoding,  convex approximation,  second-order cone programming,  

Full Text: PDF(873.3KB)>>
Buy this Article

This paper considers coordinated linear precoding for rate optimization in downlink multicell, multiuser orthogonal frequency-division multiple access networks. We focus on two different design criteria. In the first, the weighted sum-rate is maximized under transmit power constraints per base station. In the second, we minimize the total transmit power satisfying the signal-to-interference-plus-noise-ratio constraints of the subcarriers per cell. Both problems are solved using standard conic optimization packages. A less complex, fast, and provably convergent algorithm that maximizes the weighted sum-rate with per-cell transmit power constraints is formulated. We approximate the non-convex weighted sum-rate maximization (WSRM) problem with a solvable convex form by means of a sequential parametric convex approximation approach. The second-order cone formulations of an objective function and the constraints of the optimization problem are derived through a proper change of variables, first-order linear approximation, and hyperbolic constraints transformation. This algorithm converges to the suboptimal solution while taking fewer iterations in comparison to other known iterative WSRM algorithms. Numerical results are presented to demonstrate the effectiveness and superiority of the proposed algorithm.