Greedy-Based Scheduler for Multiuser Space–Time Line Coded Systems

This study proposes a low-complexity, greedy-based scheduler for multiuser space–time line coded (MU-STLC) systems. The proposed scheduler selects one user that was unscheduled in the previous scheduling period and replaces it with the currently scheduled user with minimum proportional fair priority to maximize the sum priority of the scheduled users. Consequently, the proposed greedy-based scheduler can significantly reduce computational complexity compared to existing schedulers. Furthermore, a novel low-complexity matrix inversion (LMI) algorithm has been devised to further decrease computational complexity by leveraging the order-recursive structure of the MU-STLC preprocessing matrix. Simulation results confirm that the greedy-based scheduler utilizing the LMI algorithm significantly reduces the computational complexity of existing schedulers, albeit with a slight degradation in scheduling performance.