kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Joint Multislot Scheduling and Precoding for Unicast and Multicast Scenarios in Multiuser MISO Systems
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Esch-sur-Alzette, Luxembourg; Huawei Technologies Sweden, Kista, AB, Sweden.
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Esch-sur-Alzette, Luxembourg.
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Esch-sur-Alzette, Luxembourg.
Interdisciplinary Centre for Security, Reliability and Trust (SnT), University of Luxembourg, Esch-sur-Alzette, Luxembourg.ORCID iD: 0000-0003-2298-6774
2022 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 21, no 7, p. 5004-5018Article in journal (Refereed) Published
Abstract [en]

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.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2022. Vol. 21, no 7, p. 5004-5018
National Category
Signal Processing
Identifiers
URN: urn:nbn:se:kth:diva-312605DOI: 10.1109/TWC.2021.3135701ISI: 000838503800029Scopus ID: 2-s2.0-85122065950OAI: oai:DiVA.org:kth-312605DiVA, id: diva2:1660749
Note

QC 20250327

Available from: 2022-05-24 Created: 2022-05-24 Last updated: 2025-03-27Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Ottersten, Björn

Search in DiVA

By author/editor
Ottersten, Björn
In the same journal
IEEE Transactions on Wireless Communications
Signal Processing

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 43 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf