Mureithi, George MainaMzyece, MjumoDjouani, Karim2024-10-252024-10-252014-02-012090-0147 (P)2090-0155 (E)https://doi.org/10.1049/iet-com.2013.0328https://hdl.handle.net/20.500.14519/914It is widely believed that the implementation of multi-user multiple input multiple output (MU-MIMO) technology at the radio access portion of current and future wireless networks would positively impact on the performance of such networks especially in terms of system capacity. This however demands the design of efficient multi-user scheduling algorithms at the data link layer. In the case of packet data which is delay tolerant, there is more flexibility in the design of such multi-user scheduling algorithms. One such algorithm that is known to be throughput optimal is the greedy scheduler. For the downlink of a single input single output (SISO) system, the greedy scheduler serves the user whose channel maximizes the channel capacity at each transmission opportunity. By employing this algorithm to the down- link of a MU-MIMO system applying spatial multiplexing, the scheduler can allow a subset of active users whose channels are most favourable to transmit simultaneously. However, unlike in the SISO systems, the implementation of the classical greedy scheduler in MU-MIMO systems would result in very high computational complexity. This paper proposes a low complexity greedy scheduler for the MU-MIMO downlink and through simulations, demon- strates that the low complexity greedy scheduler performs close to the classical greedy scheduler but with minimum complexity.343-350 PagesenAttribution-NonCommercial-ShareAlike 4.0 Internationalhttp://creativecommons.org/licenses/by-nc-sa/4.0/MU-MIMOSchedulingOpportunisticArticle