Pith. sign in

REVIEW 3 major objections 6 minor 30 references

Rethinking Fronthaul Topologies for Cell-Free 6G Networks

T0 review · 3 major / 6 minor · reviewed 2026-07-08 · glm-5.2

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Clos topology beats tree for 6G fronthaul

desk verdict Clos topologies for cell-free MIMO fronthaul: useful empirical contribution, but the optimal baseline is under-specified and the key Clos parameter is missing from the evaluation. read the letter →

arxiv 2607.06288 v1 pith:Z6N3XABA submitted 2026-07-07 cs.IT math.IT

Max Franke , Arash Pourdamghani , Fabian Göttsch , Stefan Schmid , Giuseppe Caire This is my paper · ORCID
classification cs.ITmath.IT
keywords cell-freeMIMOfronthaultopologyClosnetwork6GtreeloadbalancingclusterplacementO-RAN
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

As 6G cell-free MIMO deployments grow denser, the fronthaul network connecting distributed radio units to processing nodes becomes the bottleneck. The authors argue that tree topologies—the current state of the art derived from passive optical networks—cannot scale: even at 20 radio units, peak link loads exceed 300 Gbps, tripling available 100 Gbps link capacities, and they breach 800 Gbps at around 90 RUs. The paper proposes instead a Clos topology, a three-layer structured interconnect borrowed from datacenter networking, partitioning radio units into groups each served by a set of routers that connect to all distributed units. Through simulation across 20–100 RUs with varying user distributions, the authors show that Clos reduces maximum link traffic by roughly 75% compared to tree topologies and approaches the performance of a complete (fully connected) topology as network size grows, while keeping peak link loads around 200 Gbps—within reach of off-the-shelf hardware. The paper also demonstrates that demand-aware cluster placement heuristics can reduce fronthaul traffic by up to 20% relative to oblivious assignment.

What carries the argument

The paper models fronthaul demand as a traffic matrix derived from user-centric RU clusters and physical-layer data rates, then evaluates three topology classes—complete, tree, and folded Clos—under four cluster-placement heuristics (random, fixed, aware, hybrid). The Clos topology partitions RUs into groups of size p, assigns q = Q/N routers per group, and connects each DU to one router per group, creating multiple paths between any RU and any DU. Performance is measured as maximum per-link bandwidth and average link traffic, with a hop-count constraint replacing explicit delay modeling.

What would settle it

If a routed fronthaul with Clos topology measured under realistic bursty traffic patterns produces queueing delays that violate 6G latency requirements, or if the hop-count proxy for delay fails to capture real-world latency behavior, the claim that Clos 'performs almost as well as the optimal topology' would need qualification beyond link-load metrics.

Watch

Extended reading notes

Core claim

The central finding is that the topology of the fronthaul network, not the physical radio layer, becomes the binding constraint on cell-free MIMO scalability, and that the specific choice of a Clos interconnect—a multi-stage switching structure where radio units are grouped and each group connects to all distributed units via a shared router layer—achieves near-optimal load balancing at large scale while remaining deployable with existing hardware. The comparison is framed entirely in terms of maximum and average per-link traffic, with a complete (fully meshed) topology serving as the theoretical optimum computed via mixed-integer linear programming.

Load-bearing premise

The paper replaces all delay modeling with a maximum hop-count constraint, assuming that queueing delays in the routed fronthaul are negligible or eliminable via technologies like optical switches. If queueing delays under realistic bursty traffic are non-negligible, the comparison between tree and Clos topologies could shift, since Clos introduces more routing hops than trees.

Editorial extensions

If this is right

  • Tree-based fronthaul topologies will need to be replaced in any cell-free MIMO deployment exceeding roughly 20 radio units, making Clos or similar multi-path topologies a practical necessity rather than an optimization.
  • The 200 Gbps peak link loads achievable with Clos are within range of current 400 Gbps optical interfaces, suggesting no fundamental hardware breakthrough is needed—only an architectural shift.
  • Demand-aware cluster placement algorithms that consider current link utilization when assigning users to processing nodes can yield 20% traffic reductions, meaning software-level scheduling and physical-layer topology are co-dependent design problems.
  • As mmWave and sub-THz bands increase per-RU data rates by an order of magnitude, even Clos topologies may approach their limits, motivating investigation of even denser multi-stage or dynamic reconfigurable topologies.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit.

Referee Report

3 major / 6 minor

Summary. This paper studies fronthaul network topologies for cell-free MIMO in future 6G networks. The authors model fronthaul traffic demands using a physical-layer rate model from prior work (3GPP channel models, LMMSE combining, quantization-aware fronthaul load), and compare three topology types—complete (baseline), tree, and folded Clos—under several cluster-to-DU assignment heuristics (Random, Fixed, Aware, Hybrid). The main empirical finding is that tree topologies become infeasible as the number of RUs grows (exceeding 100 Gbps link capacities), while the Clos topology approaches the performance of the optimal complete topology, achieving maximum link loads around 200 Gbps that off-the-shelf hardware can support. The evaluation covers 10 instances per scenario with uniform and hotspot UE distributions at multiple user loads.

Significance. The paper addresses a timely and underexplored problem: the fronthaul network design bottleneck in cell-free MIMO, where most prior work focuses on the physical layer. The traffic demand model is grounded in 3GPP channel models and a published PHY/fronthaul framework, lending credibility to the inputs. The identification of Clos topologies as a practical middle ground between trees and complete graphs is a useful architectural contribution. However, the significance is tempered by two gaps: the MILP defining the 'optimal' baseline is never presented, and the Clos group size p is unspecified in the evaluation. These gaps prevent independent verification of the central comparison.

major comments (3)
  1. §I.B, Finding 1 and §IV.C: The central claim that 'Clos performs almost as well as the optimal topology' depends on the MILP-computed baseline being truly optimal. However, the MILP formulation is never presented anywhere in the paper—we do not know the decision variables, objective function, or constraints. Without this, the reader cannot independently assess whether the baseline is genuinely optimal or whether additional constraints or solver configurations might weaken it. The MILP formulation should be provided, at least in an appendix or supplementary material, so that the headline comparison in Fig. 6a can be independently assessed.
  2. §III.C vs. §IV.A: The Clos group size p is defined in §III.C ('We partition the first layer into groups of RUs with size p') but is never specified in the evaluation setup (§IV.A). Since the Clos topology's structure and load-balancing properties depend critically on p, and the paper does not state whether p was tuned per scenario or held fixed, the results are non-reproducible as presented. The value(s) of p used in each experiment should be reported, and if p was tuned, the tuning procedure should be described.
  3. §IV.B and §I.B: The paper reports that Clos achieves 'maximum link loads of around 200 Gbps' (Finding 1), but Fig. 6a appears to show values that may exceed this for smaller RU counts. The paper should clarify which data points correspond to the 'around 200 Gbps' claim and whether this refers to the large-L asymptotic regime specifically, to avoid overstating the result.
minor comments (6)
  1. §III.A: The delay abstraction (replacing delay with a maximum hop count) is a modeling simplification. The paper briefly justifies this with optical switch technology, but a sentence acknowledging that queueing delays under bursty traffic could affect the comparison—especially since Clos introduces more hops than trees—would improve precision.
  2. §I.A: Typo 'desgins' should be 'designs.'
  3. §III.C: The Clos construction says 'we add q = Q/N routers' per group, but the relationship between q, p, and the total number of routers Q should be stated more explicitly to help readers verify the construction.
  4. Fig. 6a: The y-axis label and units should be clearly stated (Gbps is implied but should be explicit).
  5. §IV.B: The paper reports results averaged over 10 instances but does not show error bars or confidence intervals in the figures. Adding these would strengthen the claims about the consistency of the observed trends.
  6. References [5] and [22] share co-authors with the present paper. A brief note acknowledging this overlap would be good practice.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for a careful reading and constructive feedback. All three major comments are well-taken and will be addressed in the revised manuscript. Specifically, we will add the full MILP formulation, specify the Clos group size p used in each experiment, and clarify the 'around 200 Gbps' claim with explicit reference to the relevant data points and regime.

read point-by-point responses

  1. Referee: §I.B, Finding 1 and §IV.C: The central claim that 'Clos performs almost as well as the optimal topology' depends on the MILP-computed baseline being truly optimal. However, the MILP formulation is never presented anywhere in the paper—we do not know the decision variables, objective function, or constraints. Without this, the reader cannot independently assess whether the baseline is genuinely optimal or whether additional constraints or solver configurations might weaken it. The MILP formulation should be provided, at least in an appendix or supplementary material, so that the headline comparison in Fig. 6a can be independently assessed.

    Authors: The referee is correct that the MILP formulation is absent from the current manuscript, and this is a genuine omission that weakens the paper's verifiability. We will add the full formulation in an appendix. In brief, the MILP minimizes the maximum link utilization (i.e., the peak bandwidth across all fronthaul links) subject to: (1) flow conservation constraints for both unicast UL and multicast DL traffic, (2) cluster-to-DU assignment constraints ensuring each user-centric cluster is assigned to exactly one DU with capacity beta, (3) link capacity constraints, and (4) hop-count constraints. The decision variables are binary assignment variables (cluster k to DU n) and continuous flow variables on each edge for each demand. The objective is a minimax over all link loads. We will present this formally with full notation in the revision. revision: yes

  2. Referee: §III.C vs. §IV.A: The Clos group size p is defined in §III.C ('We partition the first layer into groups of RUs with size p') but is never specified in the evaluation setup (§IV.A). Since the Clos topology's structure and load-balancing properties depend critically on p, and the paper does not state whether p was tuned per scenario or held fixed, the results are non-reproducible as presented. The value(s) of p used in each experiment should be reported, and if p was tuned, the tuning procedure should be described.

    Authors: The referee is right that the value of p is not reported in the evaluation setup, which makes the results non-reproducible as stated. In our experiments, p was set to L/N (i.e., the number of RUs divided by the number of DUs), so that each Clos group corresponds to the RUs naturally associated with one DU. This value was held fixed across all scenarios for a given (L, N) pair; it was not tuned per scenario. We will add this specification to §IV.A and also note it in the §III.C description for clarity. revision: yes

  3. Referee: §IV.B and §I.B: The paper reports that Clos achieves 'maximum link loads of around 200 Gbps' (Finding 1), but Fig. 6a appears to show values that may exceed this for smaller RU counts. The paper should clarify which data points correspond to the 'around 200 Gbps' claim and whether this refers to the large-L asymptotic regime specifically, to avoid overstating the result.

    Authors: The referee raises a fair point about precision. The 'around 200 Gbps' claim refers specifically to the large-L regime (L >= 80) under the hybrid algorithm with uniform UE distribution, as shown in Fig. 6a. For smaller RU counts (e.g., L = 20), the Clos topology's maximum link load is lower—roughly 100-150 Gbps—because the aggregate demand is smaller. The claim was intended to characterize the asymptotic behavior as the network scales, not to describe all data points. We will revise Finding 1 and the corresponding discussion in §IV.B to explicitly state that the 'around 200 Gbps' figure applies to the large-L regime and to reference the specific data points, so the result is not overstated. revision: yes

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity; the central comparison is self-contained against external benchmarks, with only minor model-adoption self-citation.

full rationale

The paper's central claim — that Clos topologies approach the performance of the optimal (complete) topology for large cell-free MIMO fronthaul networks — is evaluated through simulation with externally grounded inputs. The fronthaul traffic demands are generated from the 3GPP urban microcell street canyon pathloss model [19, Table 7.4.1-1] and standard block-fading assumptions, not from fitted parameters. The RAN and fronthaul traffic model is adopted from [5] (co-authored by Göttsch and Caire), but this is a model adoption: the SINR expressions (Eqs. 1–3), fronthaul load formula (Eq. 4), and demand matrix are computed from physical-layer parameters (channel covariance, LSFCs, pilot structure) that are independently specified and externally grounded in 3GPP standards. No result is defined in terms of the quantity it claims to predict. The Clos topology is a well-known structure [12] applied to a new context, not a renaming of a known empirical pattern. The cluster placement algorithms (Random, Fixed, Aware, Hybrid) are heuristics whose performance is measured, not fitted. The MILP baseline for the 'optimal' topology is mentioned but not shown in detail — this is a reproducibility gap (correctness risk), not a circularity issue, since the MILP is not defined in terms of the Clos results it is compared against. The self-citation to [5] for the traffic model is not load-bearing for the circularity of the comparison: the demand matrix is an input to all topologies, and the comparison between topologies is independent of how that model was derived. The only minor concern is that the cluster formation scheme and LMMSE combining vectors also come from [5], but these are standard signal processing techniques, not results that would be circular with respect to the topology comparison. Overall, the derivation chain is self-contained and the central claim has independent empirical content.

Assumptions & free parameters 6 free parameters · 5 assumptions · 0 invented entities

The paper introduces no new physical entities, particles, forces, or mathematical objects. All network elements (RUs, DUs, routers, Clos topology) are standard. The Clos topology is an existing structure from [12] applied to a new domain. The main ledger burden is in free parameters: six simulation parameters are fixed without sensitivity analysis, and the Clos group size p is never specified.

free parameters (6)
  • M (antennas per RU) = 10
    Fixed simulation parameter, not fitted but chosen for the scenario.
  • K/L (UEs per RU ratio) = 3.5, 5, 6.5
    Chosen to study different user load regimes; 3.5L is near optimal spectral efficiency per [27].
  • Δ_DU, Δ_RU, Δ_R (max degrees) = 10
    Fixed for all simulations; not justified or varied.
  • Q (number of routers) = 1.5L
    Set proportionally to RU count; not justified or optimized.
  • β (max UEs per DU) = K/10
    Set to distribute UEs across up to 10 DUs; not justified.
  • p (Clos group size) = Not specified
    The Clos partition parameter p is referenced in the topology description but never given a value or optimization procedure.
assumptions (5)
  • domain assumption Block-fading channel model with reciprocity over T signal dimensions
    §II: standard assumption cited from [2, 20, 21]; load-bearing for UL/DL fronthaul demand symmetry.
  • domain assumption Queueing delay is negligible or eliminable via optical switches
    §III.A: 'we choose to abstract delays and instead introduce a maximum hop count'; assumes technologies like [25] will mature, removing queueing from the topology comparison.
  • domain assumption Uniform power allocation q_k=1 for all DL streams
    §II.A: 'for simplicity... we choose uniform power allocation'; affects DL fronthaul load calculation.
  • domain assumption Subspace-based channel estimation and LMMSE combining from [5, 22]
    §II: the entire fronthaul demand model depends on the channel estimation and combining scheme from these references.
  • domain assumption 100 Gbps link capacity as the feasibility threshold
    §III.A, §IV.C: PON capacities at 50-100 Gbps define the feasibility boundary against which tree topology is declared infeasible.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Rethinking Fronthaul Topologies for Cell-Free 6G Networks." pith.science (2026). https://pith.science/paper/Z6N3XABA

@misc{pith2026260706288,
  author       = {Pith},
  title        = {Pith review of: Rethinking Fronthaul Topologies for Cell-Free 6G Networks},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/Z6N3XABA}},
  note         = {Machine review of arXiv:2607.06288}
}
read the original abstract

Due to significant progress in physical layer (PHY) technologies, future 6G networks are expected to feature much denser antenna deployments. Cell-free MIMO network designs are one of the most promising candidates to enable denser networks. While significant effort has been put into its PHY research, the challenges it brings to networking disciplines remain relatively unexplored. In this work, we propose various fronthaul network designs for cell-free MIMO. Our results show that while tree topologies may suffice for small-scale deployments, they become infeasible as the number of antennas increases. In contrast, with growing network size, the proposed Clos topology performs almost as well as the optimal topology.

Figures

Figures reproduced from arXiv: 2607.06288 by the authors.

Figure 1
Figure 1. This figure depicts different radio access and fronthaul network [PITH_FULL_IMAGE:figures/full_fig_p001_1.png] view at source ↗
Figure 2
Figure 2. An example of user-centric clusters and UE-RU association. [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 3
Figure 3. Example of the fronthaul data exchange between RUs [PITH_FULL_IMAGE:figures/full_fig_p003_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: A schematic view of topologies considered in this paper. In Figure 4c, the dotted green boxes show the groups containing the RUs. [PITH_FULL_IMAGE:figures/full_fig_p004_4.png]
Figure 6
Figure 6. Figure 6: Maximum traffic for various topologies (a) and average [PITH_FULL_IMAGE:figures/full_fig_p005_6.png]
Figure 7
Figure 7. Figure 7: Maximum traffic for a hotspot distribution with (a) [PITH_FULL_IMAGE:figures/full_fig_p006_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

30 extracted references · 30 canonical work pages

  1. [5]

    Joint Fronthaul Load Balancing and Computation Resource Allocation in Cell- Free User-Centric Massive MIMO Networks,

    Z. Li, F. Göttsch, S. Li, M. Chen, and G. Caire, “Joint Fronthaul Load Balancing and Computation Resource Allocation in Cell- Free User-Centric Massive MIMO Networks,”IEEE TWC, 2024

    work page 2024

  2. [1]

    Ultradense Cell-Free Massive MIMO for 6G: Technical Overview and Open Questions,

    H. Q. Ngo, G. Interdonato, E. G. Larsson, G. Caire, and J. G. Andrews, “Ultradense Cell-Free Massive MIMO for 6G: Technical Overview and Open Questions,”Proceedings of the IEEE, 2024

    work page 2024

  3. [2]

    Foundations of User-Centric Cell-Free Massive MIMO,

    Ö. T. Demir, E. Björnson, L. Sanguinettiet al., “Foundations of User-Centric Cell-Free Massive MIMO,”Found. Trends Signal Process., 2021

    work page 2021

  4. [3]

    Cell-Free Massive MIMO with Limited Backhaul,

    M. Bashar, K. Cumanan, A. G. Burr, H. Q. Ngo, and M. Debbah, “Cell-Free Massive MIMO with Limited Backhaul,” inIEEE ICC, 2018

    work page 2018

  5. [4]

    Performance Analysis of Cell- Free Massive MIMO System With Limited Fronthaul Capacity and Hardware Impairments,

    H. Masoumi and M. J. Emadi, “Performance Analysis of Cell- Free Massive MIMO System With Limited Fronthaul Capacity and Hardware Impairments,”IEEE TWC, 2019

    work page 2019

  6. [6]

    Fronthaul Resource Optimization for Cell-Free Massive MIMO Networks,

    A. G. Joshi, N. T. Khai, and T. Bauschert, “Fronthaul Resource Optimization for Cell-Free Massive MIMO Networks,” inIEEE RNDM, 2024

    work page 2024

  7. [7]

    Hybrid Network-and User-Centric Scalable Cell- Free Massive MIMO for Fronthaul Signaling Minimization,

    P. Lai, W. Xiang, W. D. Lukito, K. T. Phan, P. Cheng, C. Liu, and G. Mao, “Hybrid Network-and User-Centric Scalable Cell- Free Massive MIMO for Fronthaul Signaling Minimization,” IEEE Trans. Veh. Technol., 2024

    work page 2024

  8. [8]

    Toward demand-aware networking: a theory for self-adjusting networks,

    C. Avin and S. Schmid, “Toward demand-aware networking: a theory for self-adjusting networks,”ACM CCR, 2018

    work page 2018

Show all 30 references
  1. [9]

    Trafficengineeringwith equal-cost-multipath: An algorithmic perspective,

    M.Chiesa,G.Kindler,andM.Schapira,“Trafficengineeringwith equal-cost-multipath: An algorithmic perspective,”IEEE/ACM TON, 2017

    2017

  2. [10]

    A scalable, commod- ity data center network architecture,

    M. Al-Fares, A. Loukissas, and A. Vahdat, “A scalable, commod- ity data center network architecture,” inACM CCR, 2008

    2008

  3. [11]

    Seedtree: A dynamically optimal and local self-adjusting tree,

    A. Pourdamghani, C. Avin, R. Sama, and S. Schmid, “Seedtree: A dynamically optimal and local self-adjusting tree,” inIEEE INFOCOM, 2023

    2023

  4. [12]

    A study of non-blocking switching networks,

    C. Clos, “A study of non-blocking switching networks,”Bell System Technical J., 1953

    1953

  5. [13]

    Jupiterrising:Adecadeofclostopologiesandcentralizedcontrol in google’s datacenter network,

    A. Singh, J. Ong, A. Agarwal, G. Anderson, A. Armisteadet al., “Jupiterrising:Adecadeofclostopologiesandcentralizedcontrol in google’s datacenter network,” inACM SIGCOMM, 2015

    2015

  6. [14]

    Sirius: A flat datacenter network with nanosecond optical switching,

    H. Ballani, P. Costa, R. Behrendt, D. Cletheroe, I. Haller et al., “Sirius: A flat datacenter network with nanosecond optical switching,” inACM SIGCOMM, 2020

    2020

  7. [15]

    Traffic engineering in software defined networks,

    S. Agarwal, M. S. Kodialam, and T. V. Lakshman, “Traffic engineering in software defined networks,” inIEEE INFOCOM, 2013

    2013

  8. [16]

    The augmentation-speed tradeoff for consistent network updates,

    M. Henzinger, A. Paz, A. Pourdamghani, and S. Schmid, “The augmentation-speed tradeoff for consistent network updates,” in ACM SOSR, 2022

    2022

  9. [17]

    Virtucast: Multicast and aggregation with in-network processing: An exact single-commodity algo- rithm,

    M. Rost and S. Schmid, “Virtucast: Multicast and aggregation with in-network processing: An exact single-commodity algo- rithm,” inOPODIS. Springer, 2013

    2013

  10. [18]

    Cell-free massive mimo deployments: Fronthaul topologyoptionsandtechno-economicaspects,

    L. Furtado, A. Fernandes, A. Ohashi, F. Farias, A. Cavalcante, and J. Costa, “Cell-free massive mimo deployments: Fronthaul topologyoptionsandtechno-economicaspects,”inIEEEEuCAP, 2022

    2022

  11. [19]

    Study on Channel Model for Frequencies from 0.5 to 100 GHz (Release 16) V16.1.0,

    3GPP, “Study on Channel Model for Frequencies from 0.5 to 100 GHz (Release 16) V16.1.0,” Tech. Rep. Rep. TR 38.901, 2020

    2020

  12. [20]

    Noncooperative Cellular Wireless with Unlim- ited Numbers of Base Station Antennas,

    T. L. Marzetta, “Noncooperative Cellular Wireless with Unlim- ited Numbers of Base Station Antennas,”IEEE TWC, 2010

    2010

  13. [21]

    T. L. Marzetta, E. G. Larsson, H. Yang, and H. Q. Ngo, Fundamentals of Massive MIMO. Cambridge, U.K.: Cambridge University Press, 2016

    2016

  14. [22]

    Subspace-Based Pilot Decontamination in User-Centric Scalable Cell-Free Wireless Networks,

    F. Göttsch, N. Osawa, T. Ohseki, K. Yamazaki, and G. Caire, “Subspace-Based Pilot Decontamination in User-Centric Scalable Cell-Free Wireless Networks,”IEEE TWC, 2023

    2023

  15. [23]

    On the Ergodic Rate Lower Bounds with Applications to Massive MIMO,

    G. Caire, “On the Ergodic Rate Lower Bounds with Applications to Massive MIMO,”IEEE TWC, 2018

    2018

  16. [24]

    Measure- ment of processing and queuing delays introduced by a software router in a single-hop network,

    L. Angrisani, L. Peluso, A. Tedesco, and G. Ventre, “Measure- ment of processing and queuing delays introduced by a software router in a single-hop network,” inIEEE I2MTC, 2005

    2005

  17. [25]

    Strategies for improved temporal response of glass-based optical switches,

    M. Calvarese, P. Paiè, F. Ceccarelliet al., “Strategies for improved temporal response of glass-based optical switches,” Scientific Reports, vol. 12, p. 239, 2022

    2022

  18. [26]

    Demonstration of a real-time 100g ethernet space division multiplexing pon using a weakly coupled multicore fiber,

    S. Cwalina, S. K. Mohammadi, K. Habel, V. Jungnickel, and R. Freund, “Demonstration of a real-time 100g ethernet space division multiplexing pon using a weakly coupled multicore fiber,” inIEEE FOAN, 2023, pp. 32–35

    2023

  19. [27]

    Fairness Scheduling in User-Centric Cell-Free Massive MIMO Wireless Networks,

    F. Göttsch, N. Osawa, I. Kanno, T. Ohseki, and G. Caire, “Fairness Scheduling in User-Centric Cell-Free Massive MIMO Wireless Networks,”IEEE TWC, 2024

    2024

  20. [28]

    Base Station (BS) radio transmission and reception (Release 19) V19.0.0,

    3GPP, “Base Station (BS) radio transmission and reception (Release 19) V19.0.0,” Tech. Rep. Rep. TR 38.104, 2025

    2025

  21. [29]

    Matplotlib: A 2d graphics environment,

    J. D. Hunter, “Matplotlib: A 2d graphics environment,”Comput. Sci. Eng., 2007

    2007

  22. [30]

    Sub-thz spectrum as enabler for 6g wireless communications up to 1 tbit/s,

    Y. Corre, G. Gougeon, J.-B. Doré, S. Bicaïs, B. Miscopein, E. Faussurier, M. Saad, J. Palicot, and F. Bader, “Sub-thz spectrum as enabler for 6g wireless communications up to 1 tbit/s,” in6G Wireless Summit, 2019

    2019

Pith tools

Reviewed July 8, 2026 · model on record in the stance chip above.