Download the full-sized PDF of Exact Solutions for Certain Weighted Sum-rate and Common-rate Maximization ProblemsDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Graduate Studies and Research, Faculty of


This file is in the following collections:

Theses and Dissertations

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


Other title
massive mimo
common rate
weighted sum rate
wireless network
Type of item
Degree grantor
University of Alberta
Author or creator
Pourtahmasi Roshandeh, Koosha
Supervisor and department
Tellambura, Chintha (Electrical and Computer Engineering)
Ardakani, Masoud (Electrical and Computer Engineering)
Examining committee member and department
Khabbazian, Majid (Electrical and Computer Engineering)
Ardakani, Masoud (Electrical and Computer Engineering)
Hao, Liang (Electrical and Computer Engineering)
Tellambura, Chintha (Electrical and Computer Engineering)
Department of Electrical and Computer Engineering
Date accepted
Graduation date
2017-11:Fall 2017
Master of Science
Degree level
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.
This thesis is made available by the University of Alberta Libraries with permission of the copyright owner solely for the purpose of private, scholarly or scientific research. 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.
Citation for previous publication
Koosha Pourtahmasi Roshandeh, Ali Kuhestani, Masoud Ardakani, Chintha Tellambura: Ergodic sum rate analysis and efficient power allocation for a massive MIMO two-way relay network. IET Communications 11(2): 211-217 (2017)K. P. Roshandeh, M. Ardakani and C. Tellambura, ”Exact Solutions for Certain Weighted Sum-rate and Common-rate Maximization Problems”, Submitted to IEEE Communications Letters, 2017.

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (PDF/A)
Mime type: application/pdf
File size: 732361
Last modified: 2017:11:08 17:41:07-07:00
Filename: Pourtahmasi Roshandeh_Koosha_201709_MSc.pdf
Original checksum: 7ab44eccb2c587c69a77bc4b8e311b66
Well formed: true
Valid: true
Page count: 58
Activity of users you follow
User Activity Date