pith. sign in

arxiv: 1907.02153 · v1 · pith:EBAPJLIEnew · submitted 2019-07-03 · 📡 eess.SP · cs.IT· math.IT

An Efficient Rate-Splitting Multiple Access Scheme for the Downlink of C-RAN Systems

DaeSung Yu , Junbeom Kim , Seok-Hwan Park This is my paper

Pith reviewed 2026-05-25 09:29 UTC · model grok-4.3

classification 📡 eess.SP cs.ITmath.IT
keywords rate-splitting multiple accessC-RAN downlinkhierarchical clusteringSDMANOMAcommon signalssuperposition codinginterference management
0
0 comments X

The pith

An efficient RSMA scheme for C-RAN downlinks generates a linear number of common signals whose decoders are chosen by hierarchical clustering and outperforms SDMA, NOMA and single-common-signal RSMA.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper develops a practical version of rate-splitting multiple access for the downlink of cloud radio access networks. Instead of an exponential number of common signals, it creates only a linear number and selects the users that decode each one via hierarchical clustering. Numerical results show this version delivers higher rates than space-division multiple access, non-orthogonal multiple access, and a simpler RSMA that uses only one common signal. The goal is to retain flexible interference management while keeping the scheme computationally feasible when the number of user equipments is large.

Core claim

The proposed efficient RSMA scheme that uses a linearly increasing number of common signals whose decoding UEs are selected using hierarchical clustering achieves performance gains over conventional SDMA, NOMA, and a conventional RSMA scheme that uses a single common signal.

What carries the argument

Hierarchical clustering to choose the sets of user equipments that decode each of the linearly many common signals in the RSMA superposition coding.

If this is right

  • The scheme reduces the number of common signals from exponential to linear in the number of UEs while retaining most interference-management benefits.
  • It delivers measurable rate gains compared with both SDMA and NOMA in C-RAN downlinks.
  • The approach scales to larger user populations without the complexity explosion of ideal RSMA.
  • A single common signal is no longer required as the only practical option; intermediate numbers become feasible.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Alternative clustering algorithms could be substituted for hierarchical clustering to test whether decoder-set selection can be improved further.
  • The linear scaling may make RSMA attractive for dense deployments where conventional schemes saturate.
  • Similar selection logic could be examined in uplink or non-C-RAN multi-user settings.

Load-bearing premise

Hierarchical clustering produces a sufficiently good selection of common-message decoding sets.

What would settle it

Numerical results in which the proposed linear-complexity scheme performs no better than the single-common-signal RSMA baseline for a C-RAN downlink with a growing number of user equipments.

Figures

Figures reproduced from arXiv: 1907.02153 by DaeSung Yu, Junbeom Kim, Seok-Hwan Park.

Figure 1
Figure 1. Figure 1: Average minimum-UE rate Rmin versus per-RRH transmit power Pi (NR = 4, NU = 8, nR,i = 1 and Ci = 10). and Ci = 10. We first note that the performance gap among different schemes is more pronounced at larger transmit pow￾ers Pi due to the reduced impact of noise signals. The figure also shows that the conventional RSMA-SC scheme [5] shows significant gains over the NOMA and SDMA schemes using only a single … view at source ↗
read the original abstract

This work studies the optimization of rate-splitting multiple access (RSMA) transmission technique for a cloud radio access network (C-RAN) downlink system. Main idea of RSMA is to split the message for each user equipment (UE) to private and common messages and perform superposition coding at transmitters so as to enable flexible decoding at receivers. It is challenging to implement ideal RSMA scheme particularly when there are many UEs, since the number of common signals exponentially increases with the number of UEs. An efficient RSMA scheme is hence proposed that uses a linearly increasing number of common signals whose decoding UEs are selected using hierarchical clustering. Via numerical results, we show the performance gains of the proposed RSMA scheme over conventional space-division multiple access (SDMA) and nonorthogonal multiple access (NOMA) schemes as well as over a conventional RSMA scheme that uses a single common signal.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript proposes an efficient rate-splitting multiple access (RSMA) scheme for the downlink of cloud radio access network (C-RAN) systems. To avoid the exponential growth in common signals of ideal RSMA, the scheme employs hierarchical clustering to select decoding user equipments for a linearly increasing number of common signals. Numerical results are presented to demonstrate performance gains relative to space-division multiple access (SDMA), non-orthogonal multiple access (NOMA), and a conventional RSMA scheme that uses only a single common signal.

Significance. If the reported ordering of schemes holds under the evaluated regimes, the work supplies a concrete engineering approximation that reduces RSMA complexity from exponential to linear in the number of UEs while retaining measurable interference-management benefits. This is a useful contribution for practical C-RAN deployments where the number of users is large; the explicit framing of the clustering step as a heuristic rather than an optimality claim is appropriately cautious.

minor comments (3)
  1. The abstract states that gains are shown 'via numerical results' but supplies no information on channel models, power constraints, or Monte-Carlo sample size; these details should be added to the abstract or a dedicated simulation-setup subsection so that the headline claim can be assessed at a glance.
  2. Notation for the common-message sets produced by hierarchical clustering is introduced without an explicit algorithmic listing or pseudocode; a short algorithm box would improve reproducibility of the proposed scheme.
  3. Figure captions for the rate curves should state the number of Monte-Carlo realizations and the exact values of the power and noise parameters used, rather than referring only to 'the simulation parameters in Table I'.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive assessment of our work and the recommendation for minor revision. No specific major comments were provided in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained simulation comparison

full rationale

The paper presents an engineering heuristic (hierarchical clustering for common-message groups) and reports Monte-Carlo performance gains against SDMA, NOMA, and single-common RSMA baselines. No load-bearing equations, predictions, or uniqueness claims reduce by construction to fitted parameters or self-citations; the central result is an empirical ordering obtained from the explicitly described algorithm and channel model, which remains externally falsifiable.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; the scheme presumably inherits standard wireless assumptions such as perfect CSI and Gaussian noise that are not enumerated here.

pith-pipeline@v0.9.0 · 5694 in / 1120 out tokens · 38316 ms · 2026-05-25T09:29:19.707382+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

15 extracted references · 15 canonical work pages

  1. [1]

    Cloud r adio access network: Virtualizing wireless access for dense het erogeneous systems,

    O. Simeone, A. Maeder, M. Peng, O. Sahin and W. Y u, "Cloud r adio access network: Virtualizing wireless access for dense het erogeneous systems," J. Commun. Netw. , vol. 18, no. 2, pp. 135-149, Apr. 2016

    work page 2016

  2. [2]

    J oint precod- ing and multivariate backhaul compression for the downlink of cloud radio access networks,

    S.-H. Park, O. Simeone, O. Sahin and S. Shamai (Shitz), "J oint precod- ing and multivariate backhaul compression for the downlink of cloud radio access networks," IEEE Trans. Signal Process. , vol. 61, no. 22, pp. 5646-5658, Nov. 2013

    work page 2013

  3. [3]

    Rate-splitting multip le access for downlink communication systems: Bridging, generalizing a nd outper- forming SDMA and NOMA,

    Y . Mao, B. Clerckx and V . O. K. Li, "Rate-splitting multip le access for downlink communication systems: Bridging, generalizing a nd outper- forming SDMA and NOMA," Eurasip J. Wireless Commun. Netw. , vol. 2018, pp. 1-54, 2018

    work page 2018

  4. [4]

    NOMA systems with conte nt-centric multicast transmission for C-RAN,

    S.-R. Lee, S.-H. Park and I. Lee, "NOMA systems with conte nt-centric multicast transmission for C-RAN," IEEE Wireless Commun. Lett. , vol. 7, no. 5, pp. 828-831, Oct. 2018

    work page 2018

  5. [5]

    Rate-splitting for mul ti-antenna non-orthogonal unicast and multicast transmission,

    Y . Mao, B. Clerckx and V . O. K. Li, "Rate-splitting for mul ti-antenna non-orthogonal unicast and multicast transmission," Proc. IEEE SPAWC 2018, Kalamata, Greece, Jun. 2018

    work page 2018

  6. [6]

    Rate-splitting multip le access for coordinated multi-point joint transmission,

    Y . Mao, B. Clerckx and V . O. K. Li, "Rate-splitting multip le access for coordinated multi-point joint transmission," arXiv:1 804.10516, Apr. 2018

    work page 2018

  7. [7]

    Interference mitigation via rate-splitting in cloud radi o access net- works,

    A. A. Ahmad, H. Dahrouj, A. Chaaban, A. Sezgin and M.-S. Al ouini, "Interference mitigation via rate-splitting in cloud radi o access net- works," Proc. IEEE SPAWC 2018 , Kalamata, Greece, Jun. 2018

    work page 2018

  8. [8]

    Multicell interference mitigatio n with joint beamforming and common message decoding,

    H. Dahrouj and W. Y u, "Multicell interference mitigatio n with joint beamforming and common message decoding," IEEE Trans. Commun. , vol. 59, no. 8, pp. 2264-2273, Aug. 2011

    work page 2011

  9. [9]

    Fronthaul compression and transmit be amforming optimization for multi-antenna uplink C-RAN,

    Y . Zhou and W. Y u, "Fronthaul compression and transmit be amforming optimization for multi-antenna uplink C-RAN," IEEE Trans. Signal Process., vol. 64, no. 16, pp. 4138-4151, Aug. 2016

    work page 2016

  10. [10]

    Clustering methods,

    L. Rokach and O. Maimon, "Clustering methods," Data Mining and Knowledge Discovery Handbook , O. Maimon and L. Rokach eds., Springer, Boston, MA, 2005

    work page 2005

  11. [11]

    Hierarchical clustering

    "Hierarchical clustering" in Wikipeia: The Free Encyclopedia , available from https://en.wikipedia.org/wiki/Hierarchical_ clustering

    work page

  12. [12]

    Fairness for non-orthog onal multiple access in 5G systems,

    S. Timotheou and I. Krikidis, "Fairness for non-orthog onal multiple access in 5G systems," IEEE Signal Process. Lett. , vol. 22, no. 10, pp. 1647-1651, Oct. 2015

    work page 2015

  13. [13]

    Optimal power allocation scheme f or non- orthogonal multiple access with α-fairness,

    P . Xu and K. Cumanan, "Optimal power allocation scheme f or non- orthogonal multiple access with α-fairness," IEEE J. Sel. Areas Com- mun., vol. 35, no. 1, pp. 2357-2369, Oct. 2017

    work page 2017

  14. [14]

    Boyd and L

    S. Boyd and L. V andenberghe, Convex Optimization, Cambridge, U.K.: Cambridge Univ. Press, 2004

    work page 2004

  15. [15]

    Sparse beamforming and user-centric c lustering for downlink cloud radio access network,

    B. Dai and W. Y u, "Sparse beamforming and user-centric c lustering for downlink cloud radio access network," IEEE Access , vol. 2, 2014

    work page 2014