kth.sePublications KTH
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
Cell-Free Beamforming Design for Physical Layer Multigroup Multicasting
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Communication Systems, CoS.ORCID iD: 0000-0002-6260-7241
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Communication Systems, CoS.ORCID iD: 0000-0002-5954-434X
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Communication Systems, CoS. KRWTH Aachen University, Mobile Communications and Computing Group, Aachen, Germany.ORCID iD: 0000-0003-3876-2214
2026 (English)In: IEEE Transactions on Wireless Communications, ISSN 1536-1276, E-ISSN 1558-2248, Vol. 25, p. 5262-5274Article in journal (Refereed) Published
Abstract [en]

In many wireless communication applications, it is desirable to transmit the same data to multiple user equipments (UEs). Physical layer multicasting presents an efficient transmission topology to exploit the beamforming capabilities at the transmitting nodes and broadcast nature of the wireless channel to satisfy the demand for the same content from several UEs. An advantage of multicasting is to avoid unnecessary co-channel interference between UEs requesting the same data. The difficulty is to find the suitable beamforming configuration that guarantees an acceptable minimum data rate, among the receiving UE group, to the multicast transmission. This paper addresses the max-min fair multigroup multicast optimization problem and proposes a novel iterative elimination procedure coupled with semidefinite relaxation (SDR) to find the near-optimal rank-1 beamforming vectors in a cell-free massive MIMO (multiple-input multiple-output) network. The proposed optimization procedure significantly improves computational complexity and spectral efficiency compared to common methods that use SDR followed by some randomization procedure and the state-of-the-art difference-of-convex approximation algorithm. The importance of the proposed procedure is that it is applicable to any SDR problem where a low-rank solution is desirable. Further, we propose a low-complexity algorithm that achieves 87% of the optimal rank-1 solution at orders-of-magnitude lower computational time.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2026. Vol. 25, p. 5262-5274
Keywords [en]
cell-free massive MIMO, convex optimization, downlink beamforming, Multicast, semidefinite relaxation
National Category
Signal Processing Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-372402DOI: 10.1109/TWC.2025.3617215ISI: 001659565700024Scopus ID: 2-s2.0-105018701965OAI: oai:DiVA.org:kth-372402DiVA, id: diva2:2012035
Note

Not duplicate with DiVA 1949521

QC 20260123

Available from: 2025-11-06 Created: 2025-11-06 Last updated: 2026-01-23Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Zaher, MahmoudBjörnson, EmilPetrova, Marina

Search in DiVA

By author/editor
Zaher, MahmoudBjörnson, EmilPetrova, Marina
By organisation
Communication Systems, CoS
In the same journal
IEEE Transactions on Wireless Communications
Signal ProcessingTelecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 62 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