Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 184

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Rate-Splitting for Max-Min Fair Multigroup Multicast Beamforming in Overloaded Systems

Open access
Joudeh, Hamdi, Clerckx, Bruno · 2017 · IEEE Transactions on Wireless Communications

Abstract

In this paper, we consider the problem of achieving max-min fairness amongst multiple co-channel multicast groups through transmit beamforming. We explicitly focus on overloaded scenarios in which the number of transmitting antennas is insufficient to neutralize all inter-group interference. Such scenarios are becoming increasingly relevant in the light of growing low-latency content delivery demands, and also commonly appear in multibeam satellite systems. We derive performance limits of classical beamforming strategies using degrees of freedom (DoF) analysis unveiling their limitations; for example, rates saturate in overloaded scenarios due to inter-group interference. To tackle interference, we propose a strategy based on degraded beamforming and successive interference cancellation. While the degraded strategy resolves the rate-saturation issue, this comes at a price of sacrificing all spatial multiplexing gains. This motivates the development of a unifying strategy that combines the benefits of the two previous strategies. We propose a beamforming strategy based on rate-splitting (RS), which divides the messages intended to each group into a degraded part and a designated part, and transmits a superposition of both degraded and designated beamformed streams. The superiority of the proposed strategy is demonstrated through DoF analysis. Finally, we solve the RS beamforming design problem and demonstrate significant performance gains through simulations.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/twc.2017.2744629

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 184

Metadata

Authors
Joudeh, H., & Clerckx, B.
Venue
IEEE Transactions on Wireless Communications
Published
2017-11
Volume
16
Issue
11
Pages
7276-7289
ISSN
1536-1276 (ISSN-L)
OpenAlex
W2730744576
Cited by
184
References
2
FWCI
5.37
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.