Ergodic sum-rate maximization in OFDMA uplink with discrete rates

Weighted ergodic sum-rate maximization in OFDMA uplink is investigated. A finite set of achievable rates is assumed. The problem is formulated as a convex optimization problem. An analytical solution is derived using the Lagrangian dual decomposition. Numerical results show that the weights can be adjusted to increase the fairness in the system or to increase the priority of certain users.