O'Reilly logo

MIMO Wireless Networks, 2nd Edition by Claude Oestges, Bruno Clerckx

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Greedy User Selection

In order to decrease the computational complexity, it is common to refer to suboptimal schedulers for selecting the scheduled user set image. 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 image and image.

• Iteration-n: While and (not Done), select the user

(12.158) ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required