Skip to Main Content
This letter studies the information-theoretic sum capacity of the reverse link for multi-cell, multi-user cellular systems subjected to a peak power constraint. It is proven that, for the optimal scheduling, there will be at most one user transmitting at part of the peak power within each cell. Therefore, we approximate the optimization scheduling problem to a combination optimization problem which can be solved by standard simulated annealing algorithm. Further, we propose a low complexity cell greedy scheduling algorithm which can achieve almost the same performance as simulated annealing algorithm.
Date of Publication: November 2008