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

Chang Liu; Guoqiang Mao; Khoa Tran Phan; Peng Cheng; Phu Lai; Wei Xiang; William Damario Lukito

REVIEW 4 major objections 6 minor 21 references

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

T0 review · 4 major / 6 minor · reviewed 2026-08-11 · deepseek-v4-flash

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

Pith's one-line read The paper claims that an online, per-user association rule that reads only local large-scale channel strengths can cut inter-CPU fronthaul signaling by 71-94% and CPU processing load by up to 83%, at a spectral-efficiency cost of at most…

desk verdict Solid simulation-backed hybrid association scheme; the headline savings are conditional on a hand-set z-score threshold, but the idea and the code make it worth refereeing. read the letter →

arxiv 2412.15475 v1 pith:V5JHKWTS submitted 2024-12-20 eess.SP

Phu Lai , Wei Xiang , William Damario Lukito , Khoa Tran Phan , Peng Cheng , Chang Liu , Guoqiang Mao This is my paper · ORCID

classification eess.SP MSC 94A12

keywords cell-freemassiveMIMOuserassociationaccesspointselectionfronthaulsignalingonlinealgorithmnetwork-centricclusteringuser-centricscalability

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

This paper proposes a way to decide, online and per user, which distributed access points should serve each user in a cell-free massive MIMO network, with the goal of cutting the signaling traffic that flows between the network's central processing units. The decision uses only local channel information: the summed large-scale fading coefficients between the arriving user and each CPU's group of access points. A z-score rule classifies the user either as sitting inside one CPU's group (served by that group alone, so no inter-CPU signaling is generated) or as sitting at the intersection of groups (served by the top two groups). Simulations with 200 access points, 40 CPUs, and 50-200 users show this hybrid rule saves 71-94% of inter-CPU fronthaul signaling and up to 83% of CPU processing load compared with the state of the art on inter-CPU coordination reduction, at a cost of at most 8.6% spectral efficiency, and no loss in some cases. The claim matters because fronthaul capacity and CPU processing, not radio spectrum alone, are the practical limits on how large a cell-free network can grow.

What carries the argument

The mechanism that carries the argument is the z-score switch in Algorithm 1, which the paper calls the hybrid online user association (HybridUA) rule. For each arriving user, the network sums the large-scale fading coefficients (LSFC, the average channel gain between user and access point) over each CPU's access-point cluster, giving one number $\beta_{ku}$ per cluster; these numbers are converted to z-scores $z_{ku}$ against their own mean and standard deviation. If exactly one cluster has $z_{ku} \geq \epsilon = 0.4$ and also has the largest $\beta_{ku}$, the user is declared network-centric and served only by that cluster's access points, which generates zero inter-CPU signaling; otherwise the user is declared user-centric and served by the top $\upsilon = 2$ clusters, with the cluster contributing the most access points acting as master CPU. In both branches, access points are kept only while they contribute to the $\delta = 95\%$ large-scale fading target, which is why only about three access points per user are needed. The per-user complexity is $\mathcal{O}(U \log L)$, independent of the total user count, which is what makes the scheme scalable.

What would settle it

Reproduce the Section IV-B scenario (200 access points, 40 CPUs, 8 km², 50-200 users) with shadow-fading variance raised from the assumed 10 dB to about 14 dB, or with users deliberately concentrated along cluster borders, and re-measure the fronthaul-versus-spectral-efficiency trade-off against the SCF1lim baseline. If the 0.4 z-score cut-off no longer yields at least 71% signaling savings with no more than 8.6% spectral efficiency loss, the reported numbers do not transfer outside the tested channel statistics. A cheaper check: histogram the cluster-sum LSFC values $\beta_{ku}$ across the simulated users; if the distribution is strongly skewed or multi-modal, a z-score of 0.4 does not carry the 'stands above the mean' meaning the classification relies on.

Watch

Extended reading notes

Core claim

The paper's central claim is that a deliberately simple, locally computed association rule can capture most of the spectral-efficiency and fairness benefits of full user-centric clustering while nearly eliminating signaling between central processing units, at a per-user cost that does not grow with the total number of users. Concretely, the algorithm classifies each newly arriving user: if exactly one CPU's cluster has a summed large-scale fading z-score at or above 0.4 and is also the strongest cluster, the user is served entirely by that cluster; otherwise the user is served by the top two clusters. In both branches, the serving access points are the few that jointly contribute at least 95% of the relevant cluster large-scale fading. Against the most recent method for reducing inter-CPU coordination, the simulations report 71-94% lower fronthaul signaling load, up to 83% lower CPU processing power, and 49-83% fewer users per CPU, with per-UE spectral efficiency lower by at most 8.6% and equal in the 50-user case.

Load-bearing premise

The entire saving rests on the assumption that one fixed cut-off on how far a cluster's summed channel strength sits above the others, the 0.4 z-score threshold, correctly separates users who are safely inside one cluster from users who straddle clusters, and that this cut-off, together with the reported savings, transfers from the simulated layouts to real deployments even though the paper's own footnote notes the summed strengths are not guaranteed to be bell-shaped.

Editorial extensions

If this is right

Networks with tight fronthaul budgets can serve far more users: each new user is associated in $\mathcal{O}(U \log L)$ time with no global re-optimization, so the marginal cost of adding users is nearly flat.
Operators get a continuous dial between spectral efficiency and signaling: the paper reports that raising the thresholds buys at most about 2% extra spectral efficiency while costing up to 70% more fronthaul signaling, so the default settings sit near a sweet spot.
The weakest users do not pay for the savings: at 200 users, the 5% worst-served users under the hybrid rule get about 2.2 times the spectral efficiency of the purely network-centric LLSFB scheme.
Because only about three access points serve a typical user, fewer users share each access point, which lessens pilot contamination and is part of why the spectral efficiency loss stays small.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The normality caveat the paper itself flags suggests a direct upgrade path: replace the fixed 0.4 z-score threshold with a quantile rule fitted to the observed distribution of cluster-sum LSFC, or with a small classifier; the $\mathcal{O}(U \log L)$ structure survives and the classification boundary stops depending on an untested distributional assumption.
The method's sensitivity to how access points are grouped under CPUs is untested: all simulations use k-means cluster geometry, so an obvious stress test is re-running the comparison with hexagonal, random, or operator-style splits to see whether the 71-94% savings survive different cluster-sum distributions.
Because the classification consumes only large-scale fading, the network-centric versus user-centric label could be reused for pilot assignment, letting users in different clusters share pilots more aggressively and potentially compounding the scalability gains beyond what the paper measures.
The no-loss result at 50 users hints that the 95% LSFC selection target may over-serve network-centric users; an ablation that lowers $\delta$ for that branch could push the signaling savings still higher at large user counts.

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, and a circularity audit.

Desk Editor's Note

read the letter

Short version: the paper's main idea is simple and effective. It classifies each arriving UE as network-centric (served by one CPU's cluster) or user-centric (served by top-υ CPUs) using a z-score of summed large-scale fading coefficients, then picks APs by LSFC contribution. This is a legitimate extension of known components—k-means clustering, AP selection from [20], P-MMSE from [1]—but the specific online rule is new. The O(U log L) per-UE complexity, independent of K, is a real selling point, and the source code is on GitHub.

The numerical work is solid within its scope. Six baselines, including the two closest methods (SCF1lim and Border), are compared across UE count, CPU count, and area size. The reported 71–94% fronthaul reduction at 8.6% max SE loss is the kind of result that would matter for fronthaul-limited cell-free deployment. The fairness and 5% outage figures add useful texture. The paper also honestly notes when the scheme loses SE.

The soft spot is exactly where the stress-test note points. The decision rule hinges on ϵ=0.4, and the paper says in footnote 2 that the summed LSFCs are not guaranteed normal. That makes the z-score a heuristic standardization, not a distribution-free test. ϵ, υ, and δ were fixed after looking at the same simulation settings, and there is no sensitivity sweep, no confidence intervals, and no count of random deployments. So the "up to 94%" and "up to 8.6%" are point estimates under one threshold in one simulated geometry, not demonstrated properties across operating conditions. That said, this is a typical weakness in this subfield, and the paper partially mitigates it by varying AP/CPU ratios, area size, and K. I would call it a conditional result rather than an overstated one.

Two smaller gaps: the "dynamic UE arrivals" claim is not backed by a temporal simulation, and the clustering is a fixed k-means partition rather than learned online. These are minor.

Bottom line: if I worked on scalable cell-free MIMO, I'd want this in the literature and would cite it. It deserves a serious referee. The main request would be a threshold sensitivity analysis and some error bars before the headline numbers are treated as general.

Referee Report

4 major / 6 minor

Summary. The paper proposes HybridUA, an online UE-AP association algorithm for scalable cell-free massive MIMO. For each arriving UE, the algorithm computes z-scores of CPU-cluster-summed large-scale fading coefficients (LSFCs) and classifies the UE as network-centric if exactly one cluster's z-score exceeds a threshold epsilon and is also the maximum; otherwise it serves the UE from the top-upsilon clusters. In both cases, APs are selected to cover delta percent of the total LSFC in the chosen clusters. The paper reports simulations with K=50-200 UEs, 200 APs, 20-40 CPUs, and compares against six baselines (SCF1, SCF2, SCF1lim, Border, LLSFB, Nearest). The central quantitative claims are up to 94% inter-CPU fronthaul signaling reduction, 83% CPU processing-power reduction, and up to 8.6% spectral-efficiency loss (or none at K=50) relative to the SCF1lim baseline. Python source code is provided on GitHub.

Significance. If the reported gains are robust, HybridUA is a useful building block for fronthaul-limited cell-free deployments: the algorithm is online, uses only local channel information, and its per-UE complexity is independent of the total number of UEs. The comparison against six baselines, including the recent SCF1lim method, gives the claims a concrete reference point, and the public source code is a positive step for reproducibility. However, the headline percentages are point estimates at a single hand-set operating point (epsilon=0.4, upsilon=2, delta=95%) with no sensitivity analysis or confidence intervals, and the 'CPU processing power' claim rests on a proxy metric rather than a direct computational-cost measurement. These issues should be addressed before the quantitative claims can be considered established.

major comments (4)

[Sec. III, Algorithm 1; Sec. IV-A, IV-B] The classification threshold epsilon=0.4 (Algorithm 1, line 4) is set once in Sec. IV-A without a reported sensitivity study, and the paper's own footnote 2 states that the summed LSFCs beta_ku are not guaranteed normal, so the z-score procedure is a heuristic standardization. Because the fraction of UEs classified as network-centric directly determines the inter-CPU fronthaul load, the headline savings of 71-94% and the up-to-8.6% SE loss (Sec. IV-B, Fig. 2) are point estimates at a single operating point. A deployment with different CPU cluster sizes, shadowing variance sigma_sf, AP density, or non-uniform topology would shift the z-score distribution and thus the effective operating point. Please report a sweep over epsilon (and ideally over delta and upsilon) showing the fronthaul-SE tradeoff, and discuss how epsilon can be chosen without access to the target deployment's LSFC distribution.
[Sec. IV] No confidence intervals, standard deviations, or number of random deployments are reported for Figures 2-7. The claims are stated as precise percentages (e.g., '71-94%', '8.6%', '83%'), but without a measure of variability the reader cannot tell whether the improvements over SCF1lim are statistically significant or whether the 8.6% SE loss could be much larger in another draw. Please report per-deployment results or error bars for at least the headline metrics (fronthaul load, per-UE SE, fairness) in the key scenarios of Figs. 2 and 7.
[Sec. IV-B and IV-D, Fig. 6] The 83% CPU processing-power saving is derived solely from the average number of UEs served per CPU (Fig. 6). The computational cost of channel estimation, P-MMSE combining, and data detection also scales with the number of APs/antennas per UE and the coherence-block length, so UEs-per-CPU is only a proxy for processing load. The abstract and conclusion state '83% of the CPU processing power' without this qualification. Please either report an operation count (e.g., complex multiplications per CPU per coherence block) or explicitly rephrase the claim as a reduction in UEs per CPU, and adjust the abstract accordingly.
[Sec. III, paragraph before Algorithm 1] The complexity bound 'O(U log L)' for Lines 2-10 is not supported. Computing beta_ku for all u requires summing over all APs (O(L)), and Line 9 requires selecting APs that cover delta% of the LSFC, which in the worst case involves sorting the APs of the top-upsilon clusters, i.e., O(L log L) per UE. The stated bound appears to omit the dominant L-dependent term and is not O(U log L) in general. Please correct the bound or specify a selection procedure that indeed runs in O(U log L); the key property (independence from K) is unaffected.

minor comments (6)

[Page 2, Sec. II-B] 'We considers the absence' should be 'We consider the absence'.
[Page 5, Sec. IV-D] 'a only very small number' should be 'only a very small number'.
[Sec. III, footnote 2] Footnote 2 is important for the validity of the z-score step; it would be better placed in the main text with a more detailed discussion of when the heuristic succeeds and how the threshold should be chosen.
[Sec. IV-A] The Border baseline's 100 m distance threshold is fixed; please state whether this value was chosen to match the cluster geometry or is just an example, since it affects the comparison.
[Sec. II-C, Eq. (9)] The notation L_dagger_u is used in the objective (9a) before it is defined in (9d); please reorder for readability.
[Fig. 3 caption] The expression 'x31.3' is ambiguous; please clarify that it means 31.3x lower 5% outage SE.

Circularity Check

0 steps flagged · score 0.0 of 10

No meaningful circularity: the claimed gains are measured against external baselines in simulation; the LSFC-based heuristic is the algorithm itself, not a prediction fitted to its own output.

full rationale

The paper's central claim (94% fronthaul and 83% CPU savings at up to 8.6% SE loss) is an empirical comparison between HybridUA and external baselines (SCF1lim [12], Border [11], SCF1 [1], SCF2 [10]) under identical channel and simulation settings. No parameter is fitted to the reported metrics, and no equation predicts a value that was used as an input to the same calculation. Algorithm 1 uses LSFC sums and z-scores to classify a UE as network-centric or user-centric, then selects APs by cumulative LSFC contribution; the SE is subsequently evaluated with the standard P-MMSE model from [1] and [5]. LSFC appearing both in the association rule and in the channel model is part of the system definition, not a circular reduction. The only flagged limitation is footnote 2, which admits that z-scores are not distribution-free because the summed LSFCs are not guaranteed normal, and the thresholds (epsilon=0.4, upsilon=2, delta=95%) are fixed after inspecting the same simulations; this is a robustness or sensitivity concern, not circularity, because changing a threshold changes the operating point of the proposed algorithm but the reported comparison remains an independent measurement against externally defined baselines. There are no load-bearing self-citations: references [1], [5], [12], and [20] are by other author groups and are used for standard channel/SE models and baseline schemes. The paper is self-contained with respect to the numerical benchmarks it claims to outperform, so the circularity score is 0.

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

The method's claimed savings rely on the fixed thresholds above plus standard simulation assumptions; no new physical entities are introduced.

free parameters (3)

z-score threshold epsilon = 0.4
Controls the verdict network-centric vs user-centric; chosen as a 'sweet spot' from simulations (Sec. III, IV-A).
per-UE CPU limit upsilon = 2 CPUs
Maximum number of clusters a UE may join; fixed because up to 2 CPUs gave near-best SE at lower signaling (Sec. III, IV-A).
LSFC contribution threshold delta = 95%
APs are selected until their summed LSFC reaches 95% of the cluster(s) total; selected as robust tradeoff (Sec. III, IV-A).

assumptions (5)

ad hoc to paper The LSFC sum beta_ku per CPU cluster is an adequate association metric and its z-scores can separate network-centric from user-centric UEs.
Sec. III, Lines 2-8 of Algorithm 1; the paper's own footnote 2 admits the distribution is not guaranteed normal, yet the decision rule depends on thresholding z-scores.
domain assumption The simulated channels follow correlated Rayleigh fading without LoS (Eq. 2) and results are taken to hold for the intended deployment class.
Sec. II-B; the paper notes Rician fading exists but does not evaluate it.
domain assumption The centralized implementation and P-MMSE combining are adopted from [1] and used unmodified.
Sec. II-B; the paper's signaling-reduction conclusions are tied to this architecture.
domain assumption The fronthaul signaling model in Eq. (9) counts one N*tau_c scalar block per relayed AP signal and ignores packetization, routing, and duplicate signaling overheads.
Sec. II-C; if real fronthaul overheads scale differently, the 94% saving changes.
domain assumption The fixed k-means AP-CPU partition and static simulation snapshots represent the dynamic online deployment claimed in the abstract.
Sec. IV-A; the online nature is demonstrated by per-UE decisions, not by a temporal arrival simulation.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Hybrid Network- and User-Centric Scalable Cell-Free Massive MIMO for Fronthaul Signaling Minimization." pith.science (2026). https://pith.science/paper/V5JHKWTS

@misc{pith2026241215475,
  author       = {Pith},
  title        = {Pith review of: Hybrid Network- and User-Centric Scalable Cell-Free Massive MIMO for Fronthaul Signaling Minimization},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/V5JHKWTS}},
  note         = {Machine review of arXiv:2412.15475}
}

read the original abstract

Cell-free massive multiple-input multiple-output (CFmMIMO) coordinates a great number of distributed access points (APs) with central processing units (CPUs), effectively reducing interference and ensuring uniform service quality for user equipment (UEs). However, its cooperative nature can result in intense fronthaul signaling between CPUs in large-scale networks. To reduce the inter-CPU fronthaul signaling for systems with limited fronthaul capacity, we propose a low-complexity online UE-AP association approach for scalable CFmMIMO that combines network- and user-centric clustering methodologies, relies on local channel information only, and can handle dynamic UE arrivals. Numerical results demonstrate that compared to the state-of-the-art method on fronthaul signaling minimization, our approach can save up to 94% of the fronthaul signaling load and 83% of the CPU processing power at the cost of only up to 8.6% spectral efficiency loss, or no loss in some cases.

Figures

Figures reproduced from arXiv: 2412.15475 by the authors.

**Figure 1.** A cell-free massive MIMO system. Many studies on CFmMIMO do not take system scalability into account and often assume that the fronthaul capacity is unlimited or all APs are connected to a single CPU [3], [6], [7], [8], [9], which is clearly unscalable. As such, researchers have started investigating the scalability aspects of CFmMIMO [1], [10], which involves multiple CPUs. However, the fronthaul signaling between … view at source ↗

**Figure 2.** The bars correspond to the left y-axis, which represents perUE DL SE. The lines correspond to the right y-axis, which represents inter-CPU fronthaul signaling load. The number above each bar is the Jain’s fairness index of the UEs’ DL SE. [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗

**Figure 4.** Average number of APs serving a UE (the colored bars). The [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗

Figures from the paper (3 more)

**Figure 5.** Figure 5: Average number of UEs served by an AP (the colored bars). [PITH_FULL_IMAGE:figures/full_fig_p005_5.png]

**Figure 6.** Figure 6: Average number of UEs served by a CPU (the colored bars). [PITH_FULL_IMAGE:figures/full_fig_p005_6.png]

**Figure 7.** Figure 7: The bars correspond to the left y-axis, which represents perUE DL SE. The lines correspond to the right y-axis, which represents inter-CPU fronthaul signaling load. Each four-number tuple on the x-axis represents (total number of APs, number of antennas per AP, total …

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

21 extracted references · 19 canonical work pages

[20]

On the total energy efficiency of cell-free massive MIMO,

H. Q. Ngo, L.-N. Tran, T. Q. Duong, M. Matthaiou, and E. G. Larsson, “On the total energy efficiency of cell-free massive MIMO,” IEEE Transactions on Green Communications and Networking , vol. 2, no. 1, pp. 25–39, 2017

work page 2017
[1]

Scalable cell-free massive MIMO systems,

E. Bj ¨ornson and L. Sanguinetti, “Scalable cell-free massive MIMO systems,” IEEE Trans. Commun. , vol. 68, no. 7, pp. 4247–4261, 2020

2020
[2]

Ultra-Dense 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, “Ultra-dense cell-free massive MIMO for 6G: Technical overview and open questions,” arXiv preprint arXiv:2401.03898 , 2024

work page Pith review arXiv 2024
[3]

Cell-free massive MIMO versus small cells,

H. Q. Ngo, A. Ashikhmin, H. Yang, E. G. Larsson, and T. L. Marzetta, “Cell-free massive MIMO versus small cells,” IEEE Trans. Wireless Commun., vol. 16, no. 3, pp. 1834–1850, 2017

work page 2017
[4]

Cell-free massive MIMO: User-centric approach,

S. Buzzi and C. D’Andrea, “Cell-free massive MIMO: User-centric approach,” IEEE Wireless Commun. Lett. , vol. 6, no. 6, pp. 706–709, 2017

work page 2017
[5]

Foundations of user- centric cell-free massive MIMO,

¨O. T. Demir, E. Bj ¨ornson, L. Sanguinetti et al. , “Foundations of user- centric cell-free massive MIMO,” Foundations and Trends in Signal Processing, vol. 14, no. 3-4, pp. 162–472, 2021

work page 2021
[6]

Joint power control and access point scheduling in fronthaul-constrained uplink cell-free massive MIMO systems,

M. Guenach, A. A. Gorji, and A. Bourdoux, “Joint power control and access point scheduling in fronthaul-constrained uplink cell-free massive MIMO systems,” IEEE Trans. Commun., vol. 69, no. 4, pp. 2709–2722, 2020

work page 2020
[7]

Learning-based downlink power allocation in cell-free massive MIMO systems,

M. Zaher, ¨O. T. Demir, E. Bj ¨ornson, and M. Petrova, “Learning-based downlink power allocation in cell-free massive MIMO systems,” IEEE Trans. Wireless Commun., vol. 22, no. 1, pp. 174–188, 2022

work page 2022

Show all 21 references

[8]

Joint Decoding and UE-APs Association for Scalable Cell-Free Systems,

J. Kassam, D. Castanheira, A. Silva, R. Dinis, and A. Gameiro, “Joint Decoding and UE-APs Association for Scalable Cell-Free Systems,” IEEE Trans. Commun. , 2023

2023
[9]

Downlink resource allocation in multiuser cell-free MIMO networks with user-centric clustering,

H. A. Ammar, R. Adve, S. Shahbazpanahi, G. Boudreau, and K. V . Srinivas, “Downlink resource allocation in multiuser cell-free MIMO networks with user-centric clustering,” IEEE Trans. Wireless Commun. , vol. 21, no. 3, pp. 1482–1497, 2021

2021
[10]

Scalability aspects of cell-free massive MIMO,

G. Interdonato, P. Frenger, and E. G. Larsson, “Scalability aspects of cell-free massive MIMO,” in IEEE International Conference on Communications (ICC). IEEE, 2019, pp. 1–6

2019
[11]

Cell-free mMIMO support in the O-RAN architecture: A PHY layer perspective for 5G and beyond networks,

V . Ranjbar, A. Girycki, M. A. Rahman, S. Pollin, M. Moonen, and E. Vinogradov, “Cell-free mMIMO support in the O-RAN architecture: A PHY layer perspective for 5G and beyond networks,” IEEE Commu- nications Standards Magazine , vol. 6, no. 1, pp. 28–34, 2022

2022
[12]

Reducing Inter-CPU Coordination in User-Centric Distributed Massive MIMO Networks,

M. M. Freitas, D. D. Souza, D. B. da Costa, A. M. Cavalcante, L. Valcarenghi, G. S. Borges, R. Rodrigues, and J. C. Costa, “Reducing Inter-CPU Coordination in User-Centric Distributed Massive MIMO Networks,” IEEE Wireless Commun. Lett. , 2023

2023
[13]

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

Z. Li, F. G ¨ottsch, S. Li, M. Chen, and G. Caire, “Joint Fronthaul Load Balancing and Computation Resource Allocation in Cell-Free User- Centric Massive MIMO Networks,” arXiv preprint arXiv:2310.14911 , 2023

2023 arXiv
[14]

User- centric access point selection in cell-free massive MIMO systems: A game-theoretic approach,

C. Wei, K. Xu, X. Xia, Q. Su, M. Shen, W. Xie, and C. Li, “User- centric access point selection in cell-free massive MIMO systems: A game-theoretic approach,” IEEE Commun. Lett., vol. 26, no. 9, pp. 2225– 2229, 2022

2022
[15]

Joint power and user grouping optimization in cell-free massive MIMO systems,

F. Guo, H. Lu, and Z. Gu, “Joint power and user grouping optimization in cell-free massive MIMO systems,” IEEE Trans. Wireless Commun. , vol. 21, no. 2, pp. 991–1006, 2021

2021
[16]

Joint power allocation and access point selection for cell-free massive MIMO,

T. X. Vu, S. Chatzinotas, S. ShahbazPanahi, and B. Ottersten, “Joint power allocation and access point selection for cell-free massive MIMO,” in IEEE International Conference on Communications (ICC) . IEEE, 2020, pp. 1–6

2020
[17]

Rate- Splitting Multiple Access in Cell-Free Massive MIMO-URLLC Systems: Achievable Rate Analysis and Optimization,

Y . Zhang, H. Zhao, Y . Mao, W. Xia, W. Lu, and H. Zhu, “Rate- Splitting Multiple Access in Cell-Free Massive MIMO-URLLC Systems: Achievable Rate Analysis and Optimization,” IEEE Trans. Commun. , 2024

2024
[18]

Performance analysis of cell-free massive MIMO-URLLC systems over correlated Ri- cian fading channels with phase shifts,

Y . Zhang, W. Xia, H. Zhao, Y . Zhu, W. Xu, and W. Lu, “Performance analysis of cell-free massive MIMO-URLLC systems over correlated Ri- cian fading channels with phase shifts,” IEEE Trans. Wireless Commun., 2024

2024
[19]

Massive MIMO networks: Spectral, energy, and hardware efficiency,

E. Bj ¨ornson, J. Hoydis, L. Sanguinetti et al., “Massive MIMO networks: Spectral, energy, and hardware efficiency,” Foundations and Trends® in Signal Processing, vol. 11, no. 3-4, pp. 154–655, 2017

2017
[21]

Optimality properties, distributed strategies, and measurement-based evaluation of coordinated multicell OFDMA transmission,

E. Bjornson, N. Jalden, M. Bengtsson, and B. Ottersten, “Optimality properties, distributed strategies, and measurement-based evaluation of coordinated multicell OFDMA transmission,” IEEE Trans. Signal Pro- cess., vol. 59, no. 12, pp. 6086–6101, 2011

2011

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.

[1] [20]

On the total energy efficiency of cell-free massive MIMO,

H. Q. Ngo, L.-N. Tran, T. Q. Duong, M. Matthaiou, and E. G. Larsson, “On the total energy efficiency of cell-free massive MIMO,” IEEE Transactions on Green Communications and Networking , vol. 2, no. 1, pp. 25–39, 2017

work page 2017

[2] [1]

Scalable cell-free massive MIMO systems,

E. Bj ¨ornson and L. Sanguinetti, “Scalable cell-free massive MIMO systems,” IEEE Trans. Commun. , vol. 68, no. 7, pp. 4247–4261, 2020

2020

[3] [2]

Ultra-Dense 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, “Ultra-dense cell-free massive MIMO for 6G: Technical overview and open questions,” arXiv preprint arXiv:2401.03898 , 2024

work page Pith review arXiv 2024

[4] [3]

Cell-free massive MIMO versus small cells,

H. Q. Ngo, A. Ashikhmin, H. Yang, E. G. Larsson, and T. L. Marzetta, “Cell-free massive MIMO versus small cells,” IEEE Trans. Wireless Commun., vol. 16, no. 3, pp. 1834–1850, 2017

work page 2017

[5] [4]

Cell-free massive MIMO: User-centric approach,

S. Buzzi and C. D’Andrea, “Cell-free massive MIMO: User-centric approach,” IEEE Wireless Commun. Lett. , vol. 6, no. 6, pp. 706–709, 2017

work page 2017

[6] [5]

Foundations of user- centric cell-free massive MIMO,

¨O. T. Demir, E. Bj ¨ornson, L. Sanguinetti et al. , “Foundations of user- centric cell-free massive MIMO,” Foundations and Trends in Signal Processing, vol. 14, no. 3-4, pp. 162–472, 2021

work page 2021

[7] [6]

Joint power control and access point scheduling in fronthaul-constrained uplink cell-free massive MIMO systems,

M. Guenach, A. A. Gorji, and A. Bourdoux, “Joint power control and access point scheduling in fronthaul-constrained uplink cell-free massive MIMO systems,” IEEE Trans. Commun., vol. 69, no. 4, pp. 2709–2722, 2020

work page 2020

[8] [7]

Learning-based downlink power allocation in cell-free massive MIMO systems,

M. Zaher, ¨O. T. Demir, E. Bj ¨ornson, and M. Petrova, “Learning-based downlink power allocation in cell-free massive MIMO systems,” IEEE Trans. Wireless Commun., vol. 22, no. 1, pp. 174–188, 2022

work page 2022