Exact Solutions for Certain Weighted Sum-rate and Common-rate Maximization Problems

  • Author / Creator
    Pourtahmasi Roshandeh, Koosha
  • Weighted sum-rate and common-rate optimization problems in wireless networks can be represented as the general forms of $\max\limits_{}~ \sum_{i=1}^N a_i\log_2(1+\gamma_{i})$ and $\max~ \min\limits_{i} (\gamma_{i})$, respectively, where $\gamma_i$ represents the signal to noise ratio (SNR) of user $i$ and $a_i$ is a constant weight. In general, these problems are hard to solve. In this thesis, we propose a framework for finding the optimal solution of a class of such problems. To develop this framework, we first pose the optimization problems in general forms. Subject to some conditions on the region of feasible SNRs, the optimal solutions then are analytically derived. We show that these solutions apply to several practical scenarios. In particular, we optimize two different two-way relay networks where either the relay has a large number of antennas or the users. For these systems, we derive closed-form expressions for the optimal weighted sum rate and common rate. Numerical results and simulations verify the optimality of the analytical approach.

  • Subjects / Keywords
  • Graduation date
    Fall 2017
  • Type of Item
  • Degree
    Master of Science
  • DOI
  • License
    This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for non-commercial purposes. This thesis, or any portion thereof, may not otherwise be copied or reproduced without the written consent of the copyright owner, except to the extent permitted by Canadian copyright law.