Greedy User Selection
In order to decrease the computational complexity, it is common to refer to suboptimal schedulers for selecting the scheduled user set 
. A popular algorithm is the greedy user selection algorithm [DS05], which consists in successively adding a user to the tentative scheduled user set only if the weighted sum-rate is increased.
• Initialization step: We fix 
and 
.
• Iteration-n: While and (not Done), select the user
(12.158) ...
Get MIMO Wireless Networks, 2nd Edition now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
