Joint Multislot Scheduling and Precoding for Unicast and Multicast Scenarios in Multiuser MISO Systems

• Published in: IEEE transactions on wireless communications Vol. 21; no. 7; pp. 5004 - 5018
• Main Authors: Bandi, Ashok, Shankar, Mysore R. Bhavani, Chatzinotas, Symeon, Ottersten, Bjorn
• Format: Journal Article
• Language: English
• Published: New York IEEE 01-07-2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Boolean algebra; Channels; convex-concave procedure; difference-of-convex; Iterative algorithms; Mathematical programming; Minimization; MISO communication; Multicasting; Precoding; Scheduling; Switching frequency; Time factors; Unicast; User scheduling; Wireless networks
• ISSN: 1536-1276; 1558-2248; 1558-2248
• DOI: 10.1109/TWC.2021.3135701

This paper studies the joint multislot design of user scheduling and precoding to minimize the time needed to serve all the users for unicast and multicast transmission in single-cell multiuser MISO downlink systems. In the literature, the joint design of scheduling and precoding is typically undertaken based on feedback from previous slots. In a system with time-varying channels and QoS requirements, joint multislot designs can achieve better performance since they have the flexibility to schedule users over multiple slots and also can split users across slots efficiently. Further, a joint multislot design can provide a feasible solution even when the sequential design fails. In this paper, scheduling is represented by a binary matrix where the rows represent users, columns represent slots and entries represent scheduling of users in the slots. Noticing that the users may not be permuted across slots for time-varying channels, service time needed for scheduling is rendered as the highest column index corresponding to non-zero columns. With the help of binary scheduling matrix, service time minimization is formulated as a structured mixed-Boolean fractional programming. Further, by exploiting the hidden convex-concave structure in the problem, a convex-concave procedure-based iterative algorithm is proposed. Finally, we vindicate the necessity and illustrate the superiority in performance of joint multislot design over the sequential solution through Monte-Carlo simulations.