pith. sign in

arxiv: 2601.04011 · v1 · submitted 2026-01-07 · 💻 cs.IT · eess.SP· math.IT

Flexible-Duplex Cell-Free Architecture for Secure Uplink Communications in Low-Altitude Wireless Networks

Pith reviewed 2026-05-16 16:22 UTC · model grok-4.3

classification 💻 cs.IT eess.SPmath.IT
keywords flexible duplexcell-free networksphysical layer securityartificial noiseUAV communicationssecrecy ratepenalty dual decomposition
0
0 comments X

The pith

Flexible-duplex cell-free architecture lets each AP dynamically receive UAV uplink or transmit artificial noise to raise secrecy rates.

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

The paper introduces a cell-free setup in which distributed access points can switch on the fly between collecting signals from a UAV and emitting coordinated artificial noise to jam eavesdroppers. This mode flexibility adds an extra spatial degree of freedom that fixed-role cell-free systems lack, addressing the exposure of low-altitude UAV links. The authors pose a max-min secrecy-rate problem and solve it first by closed-form combiners then by a penalty dual decomposition algorithm that converges to a stationary point; a cheaper sequential heuristic reaches more than 90 percent of that performance. If the gains hold, uplink UAV traffic in future low-altitude networks can be protected without extra hardware at the UAV itself.

Core claim

In the proposed flexible-duplex cell-free architecture each access point independently chooses to act as a receiver for UAV uplink collection or as a transmitter of cooperative artificial noise; jointly optimizing the mode selection, receive combiners and noise covariance matrices produces substantially higher secrecy rates than any fixed-role cell-free baseline, while a low-complexity sequential procedure that fixes modes by a heuristic metric and then iterates closed-form covariance updates recovers over 90 percent of the optimal secrecy performance at roughly one-tenth the computational cost.

What carries the argument

AP-level flexible-duplex mode selection together with penalty dual decomposition that alternately optimizes closed-form receive combiners and AN covariance matrices under a max-min secrecy-rate objective.

If this is right

  • Flexible-duplex mode selection yields substantial secrecy-rate gains over cell-free systems that fix each AP as receiver or jammer.
  • The joint PDD optimization reaches the highest secrecy performance among the compared schemes.
  • The low-complexity sequential scheme retains over 90 percent of optimal secrecy rate while cutting complexity by an order of magnitude.
  • The architecture supplies a practical route to secure UAV uplink collection in low-altitude networks.

Where Pith is reading between the lines

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

  • The same mode-selection logic could be applied to multi-UAV scenarios where several vehicles share the same AP pool for simultaneous protection.
  • Energy-aware extensions might let APs harvest power while acting as jammers to offset the extra transmit cost of artificial noise.
  • The framework might transfer directly to terrestrial cell-free deployments facing similar line-of-sight eavesdropping threats.

Load-bearing premise

Access points can switch instantly between receive and transmit modes with perfect synchronization and without hardware limits while perfect channel state information is available for both legitimate and eavesdropper links.

What would settle it

A hardware testbed or Monte-Carlo run in which AP switching incurs even modest delay or imperfect eavesdropper CSI causes the reported secrecy-rate advantage over fixed-role cell-free systems to vanish.

Figures

Figures reproduced from arXiv: 2601.04011 by Dongming Wang, Jiacheng Yao, Wei Shi, Wei Xu, Wenhao Hu, Yongming Huang.

Figure 1
Figure 1. Figure 1: Illustration of a flexible-duplex CF architecture [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 3
Figure 3. Figure 3: Secrecy rate versus AN power budget, Pm [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figure 2
Figure 2. Figure 2: Three-dimensional topology of the considered [PITH_FULL_IMAGE:figures/full_fig_p011_2.png] view at source ↗
Figure 5
Figure 5. Figure 5: Secrecy rate versus UAV transmit power, pk [PITH_FULL_IMAGE:figures/full_fig_p012_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Secrecy rate under matched/mismatched assumptions. fixed portion of APs can lead to severe AN leakage and even harm secrecy performance when mode selection is not jointly optimized. Across the entire range, the proposed joint optimization achieves the highest secrecy rate, while the low-complexity sequential scheme closely follows and maintains consistently large gains over both baselines [PITH_FULL_IMAGE… view at source ↗
read the original abstract

Low-altitude wireless networks (LAWNs) are expected to play a central role in future 6G infrastructures, yet uplink transmissions of uncrewed aerial vehicles (UAVs) remain vulnerable to eavesdropping due to their limited transmit power, constrained antenna resources, and highly exposed air-ground propagation conditions. To address this fundamental bottleneck, we propose a flexible-duplex cell-free (CF) architecture in which each distributed access point (AP) can dynamically operate either as a receive AP for UAV uplink collection or as a transmit AP that generates cooperative artificial noise (AN) for secrecy enhancement. Such AP-level duplex flexibility introduces an additional spatial degree of freedom that enables distributed and adaptive protection against wiretapping in LAWNs. Building upon this architecture, we formulate a max-min secrecy-rate problem that jointly optimizes AP mode selection, receive combining, and AN covariance design. This tightly coupled and nonconvex optimization is tackled by first deriving the optimal receive combiners in closed form, followed by developing a penalty dual decomposition (PDD) algorithm with guaranteed convergence to a stationary solution. To further reduce computational burden, we propose a low-complexity sequential scheme that determines AP modes via a heuristic metric and then updates the AN covariance matrices through closed-form iterations embedded in the PDD framework. Simulation results show that the proposed flexible-duplex architecture yields substantial secrecy-rate gains over CF systems with fixed AP roles. The joint optimization method attains the highest secrecy performance, while the low-complexity approach achieves over 90% of the optimal performance with an order-of-magnitude lower computational complexity, offering a practical solution for secure uplink communications in LAWNs.

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

2 major / 1 minor

Summary. The manuscript proposes a flexible-duplex cell-free architecture for secure uplink communications in low-altitude wireless networks (LAWNs), where each access point (AP) can dynamically switch between receiving UAV uplink signals and transmitting cooperative artificial noise (AN). It formulates a max-min secrecy-rate optimization jointly over AP mode selection indicators, receive combiners, and AN covariance matrices. Closed-form combiners are derived, followed by a penalty dual decomposition (PDD) algorithm with stated convergence to a stationary point; a low-complexity sequential heuristic is also proposed. Simulations claim substantial secrecy-rate gains over fixed-role cell-free baselines, with the low-complexity method attaining over 90% of the joint optimum at an order-of-magnitude lower complexity.

Significance. If the idealized assumptions hold, the architecture introduces a useful spatial degree of freedom for physical-layer security in UAV networks. The closed-form combiner derivation and guaranteed-convergent PDD solver are clear technical strengths, as is the explicit performance-complexity tradeoff demonstrated by the low-complexity variant. The work is timely for 6G LAWNs but its impact hinges on whether the reported gains survive relaxation of perfect eavesdropper CSI and unconstrained mode switching.

major comments (2)
  1. [System Model and Problem Formulation] System model and problem formulation: the max-min secrecy-rate objective and feasible set rest on the assumption of perfect instantaneous CSI for both legitimate and eavesdropper channels together with zero-cost, perfectly synchronized AP mode switching. These assumptions are load-bearing; the secrecy-rate expressions and the reported gains over fixed-role baselines do not hold once either is relaxed, yet no imperfect-CSI variant or robustness analysis is provided.
  2. [Simulation Results] Simulation results: the secrecy-rate curves are presented without error bars, confidence intervals, or statistical significance tests. In addition, the exact air-ground channel models (path-loss exponents, Rician K-factors, shadowing variances) and any post-hoc parameter tuning are not fully specified, preventing independent verification of the claimed 'substantial gains' and the 'over 90% of optimal' figure.
minor comments (1)
  1. [Abstract] The abstract states that the low-complexity scheme achieves 'over 90% of the optimal performance' but does not specify the exact secrecy-rate metric or the precise simulation conditions under which this ratio is measured.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and valuable comments. We address each major comment below and outline the revisions we will incorporate to improve the manuscript.

read point-by-point responses
  1. Referee: [System Model and Problem Formulation] System model and problem formulation: the max-min secrecy-rate objective and feasible set rest on the assumption of perfect instantaneous CSI for both legitimate and eavesdropper channels together with zero-cost, perfectly synchronized AP mode switching. These assumptions are load-bearing; the secrecy-rate expressions and the reported gains over fixed-role baselines do not hold once either is relaxed, yet no imperfect-CSI variant or robustness analysis is provided.

    Authors: We agree that the model relies on perfect CSI and idealized mode switching, which are standard for deriving fundamental limits and closed-form solutions in physical-layer security analyses. The PDD algorithm and combiner derivations are tractable only under these conditions. In the revision we will add a new subsection in the discussion section that explicitly acknowledges these assumptions as limitations, analyzes their impact qualitatively, and outlines extensions to robust or stochastic CSI models as future work. We do not claim the gains hold universally without them. revision: partial

  2. Referee: [Simulation Results] Simulation results: the secrecy-rate curves are presented without error bars, confidence intervals, or statistical significance tests. In addition, the exact air-ground channel models (path-loss exponents, Rician K-factors, shadowing variances) and any post-hoc parameter tuning are not fully specified, preventing independent verification of the claimed 'substantial gains' and the 'over 90% of optimal' figure.

    Authors: We accept this point. The revised manuscript will include error bars (standard deviation over 1000 Monte Carlo trials), 95% confidence intervals on the plotted curves, and a fully specified channel model table listing all path-loss exponents, Rician K-factors, shadowing variances, and UAV altitude ranges. Any parameter choices will be justified with references to standard air-ground models. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation uses standard secrecy-rate expressions and external fixed-role baselines

full rationale

The paper formulates a max-min secrecy-rate objective using conventional information-theoretic expressions for rates with artificial noise, derives closed-form receive combiners via standard techniques, and applies the PDD algorithm to the resulting nonconvex program. No quantity is fitted to a data subset inside the paper and then presented as an independent prediction; the reported gains are obtained by comparing against separately defined fixed-role CF baselines. The central claims rest on idealized assumptions (perfect CSI, unconstrained mode switching) rather than on any self-referential reduction or self-citation chain that would force the result by construction. The derivation chain is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

2 free parameters · 2 axioms · 0 invented entities

The claim rests on standard wireless secrecy models plus the novel introduction of per-AP duplex flexibility as an extra optimization variable; no new physical entities are postulated.

free parameters (2)
  • AP mode selection indicators
    Binary variables deciding receive or transmit role for each AP, optimized jointly in the max-min problem.
  • Transmit power budgets
    Power limits for UAV uplink and AN transmission, treated as fixed inputs to the optimization.
axioms (2)
  • domain assumption Perfect channel state information for legitimate and eavesdropper links
    Required to derive closed-form combiners and solve the secrecy-rate optimization.
  • domain assumption Quasi-static flat-fading channels
    Standard assumption enabling the secrecy-rate expressions used in the formulation.

pith-pipeline@v0.9.0 · 5614 in / 1364 out tokens · 41952 ms · 2026-05-16T16:22:36.302059+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

40 extracted references · 40 canonical work pages

  1. [1]

    Ubiquitous UA V communi- cation enabled low-altitude economy: Applications, techniques, and 3GPP’s efforts,

    D. He, W. Yuan, J. Wu, and R. Liu, “Ubiquitous UA V communi- cation enabled low-altitude economy: Applications, techniques, and 3GPP’s efforts,” IEEE Netw., early access, 2025

  2. [2]

    Toward dual-functional LA WN: Control-aware system design for aerodynamics-aided UA V formations,

    J. Wu, W. Yuan, Q. Cheng, and H. Jin, “Toward dual-functional LA WN: Control-aware system design for aerodynamics-aided UA V formations,” IEEE J. Sel. Areas Commun., early access, 2025

  3. [3]

    Intelligent reflec- tion enabling technologies for integrated and green Internet-of- Everything beyond 5G: Communication, sensing, and security,

    W. Shi, W. Xu, X. You, C. Zhao, and K. Wei, “Intelligent reflec- tion enabling technologies for integrated and green Internet-of- Everything beyond 5G: Communication, sensing, and security,” IEEE Wireless Commun., vol. 30, no. 2, pp. 147–154, Apr. 2023

  4. [4]

    From ground to sky: Architectur es, applications, and challenges shaping low-altitude wirele ss networks,

    W. Yuan, Y. Cui, J. Wang, F. Liu, G. Sun, T. Xiang et al., “From ground to sky: Architectures, applications, and chal- lenges shaping low-altitude wireless networks,” arXiv preprint arXiv:2506.12308, 2025

  5. [5]

    Edge learning for B5G networks with distributed signal processing: Semantic communication, edge computing, and wireless sensing,

    W. Xu et al., “Edge learning for B5G networks with distributed signal processing: Semantic communication, edge computing, and wireless sensing,” IEEE J. Sel. Topics Signal Process., vol. 17, no. 1, pp. 9–39, Jan. 2023

  6. [6]

    Co-design of sensing, communications, and control for low-altitude wireless networks,

    H. Jin, J. Wu, W. Yuan, F. Liu, and Y. Cui, “Co-design of sensing, communications, and control for low-altitude wireless networks,” IEEE Trans. Mobile Comput., vol. 24, no. 11, pp. 12 035–12 048, Nov. 2025

  7. [7]

    Physical layer security in UA V systems: Challenges and opportunities,

    X. Sun, D. W. K. Ng, Z. Ding, Y. Xu, and Z. Zhong, “Physical layer security in UA V systems: Challenges and opportunities,” IEEE Wireless Commun., vol. 26, no. 5, pp. 40–47, 2019

  8. [8]

    Secure UA V commu- nication networks over 5G,

    B. Li, Z. Fei, Y. Zhang, and M. Guizani, “Secure UA V commu- nication networks over 5G,” IEEE Wireless Commun., vol. 26, no. 5, pp. 114–120, 2019

  9. [9]

    What will the future of UA V cellular commu- nications be? a flight from 5G to 6G,

    G. Geraci et al., “What will the future of UA V cellular commu- nications be? a flight from 5G to 6G,” IEEE Commun. Surveys Tuts., vol. 24, no. 3, pp. 1304–1335, 2022

  10. [10]

    Cell-free massive MIMO: A survey,

    S. Elhoushy, M. Ibrahim, and W. Hamouda, “Cell-free massive MIMO: A survey,” IEEE Commun. Surveys Tuts., vol. 24, no. 1, pp. 492–523, 2021

  11. [11]

    Joint user association and hybrid beamforming designs for cell-free mmwave MIMO communications,

    Z. Wang, M. Li, R. Liu, and Q. Liu, “Joint user association and hybrid beamforming designs for cell-free mmwave MIMO communications,” IEEE Trans. Commun., vol. 70, no. 11, pp. 7307–7321, 2022

  12. [12]

    Robust beamforming design for RIS-aided cell-free systems with CSI uncertainties and capacity-limited backhaul,

    J. Yao, J. Xu, W. Xu, D. W. K. Ng, C. Yuen, and X. You, “Robust beamforming design for RIS-aided cell-free systems with CSI uncertainties and capacity-limited backhaul,” IEEE Trans. Commun., vol. 71, no. 8, pp. 4636–4649, 2023

  13. [13]

    On privacy, security, and trustworthiness in distributed wireless large AI models,

    Z. Yang, W. Xu, L. Liang, Y. Cui, Z. Qin, and M. Debbah, “On privacy, security, and trustworthiness in distributed wireless large AI models,” Sci. China Inf. Sci., vol. 68, no. 7, pp. 1– 15, 2025

  14. [14]

    Air-ground collaborative resource optimization in UA V empowered cell-free massive MIMO systems,

    L. Xu, Q. Zhu, W. Xia, T. Q. Quek, and H. Zhu, “Air-ground collaborative resource optimization in UA V empowered cell-free massive MIMO systems,” IEEE Trans. Commun., vol. 72, no. 4, pp. 2485–2499, 2023. 14

  15. [15]

    Analysis of UA V communications in cell-free massive MIMO systems,

    C. D’Andrea, A. Garcia-Rodriguez, G. Geraci, L. G. Giordano, and S. Buzzi, “Analysis of UA V communications in cell-free massive MIMO systems,” IEEE Open J. Commun. Soc., vol. 1, pp. 133–147, 2020

  16. [16]

    UA V communications with WPT-aided cell-free massive MIMO systems,

    J. Zheng, J. Zhang, and B. Ai, “UA V communications with WPT-aided cell-free massive MIMO systems,” IEEE J. Sel. Areas Commun., vol. 39, no. 10, pp. 3114–3128, 2021

  17. [17]

    UA V- enabled hardware-impaired spatially correlated cell-free massive MIMO systems: Analysis and energy efficiency optimization,

    V. Tentu, E. Sharma, D. N. Amudala, and R. Budhiraja, “UA V- enabled hardware-impaired spatially correlated cell-free massive MIMO systems: Analysis and energy efficiency optimization,” IEEE Trans. Commun., vol. 70, no. 4, pp. 2722–2741, 2022

  18. [18]

    Energy-efficient multi- agent reinforcement learning for UA V trajectory optimization in cell-free massive MIMO networks,

    Z. Liu, J. Zhang, Y. Zeng, and B. Ai, “Energy-efficient multi- agent reinforcement learning for UA V trajectory optimization in cell-free massive MIMO networks,” IEEE Trans. Wireless Commun., vol. 24, no. 7, pp. 5917–5930, 2025

  19. [19]

    Power control in cell- free massive MIMO networks for UA Vs URLLC under the finite blocklength regime,

    M. Elwekeil, A. Zappone, and S. Buzzi, “Power control in cell- free massive MIMO networks for UA Vs URLLC under the finite blocklength regime,” IEEE Trans. Commun., vol. 71, no. 2, pp. 1126–1140, 2022

  20. [20]

    Combating interference for over-the-air federated learning: A statistical approach via RIS,

    W. Shi et al., “Combating interference for over-the-air federated learning: A statistical approach via RIS,” IEEE Trans. Signal Process., vol. 73, pp. 936–953, Feb. 2025

  21. [21]

    Cell-free massive MIMO networks: Optimal power control against active eavesdropping,

    T. M. Hoang, H. Q. Ngo, T. Q. Duong, H. D. Tuan, and A. Marshall, “Cell-free massive MIMO networks: Optimal power control against active eavesdropping,” IEEE Trans. Commun., vol. 66, no. 10, pp. 4724–4737, 2018

  22. [22]

    Secure transmission in cell-free massive MIMO with RF im- pairments and low-resolution ADCs/DACs,

    X. Zhang, T. Liang, K. An, G. Zheng, and S. Chatzinotas, “Secure transmission in cell-free massive MIMO with RF im- pairments and low-resolution ADCs/DACs,” IEEE Trans. Veh. Technol., vol. 70, no. 9, pp. 8937–8949, 2021

  23. [23]

    Exploiting RIS for limiting information leakage to active eavesdropper in cell-free massive MIMO,

    S. Elhoushy, M. Ibrahim, and W. Hamouda, “Exploiting RIS for limiting information leakage to active eavesdropper in cell-free massive MIMO,” IEEE Wireless Commun. Lett., vol. 11, no. 3, pp. 443–447, 2021

  24. [24]

    Secrecy performance evaluation of scalable cell-free massive MIMO systems: A stochastic geometry approach,

    X. Ma, X. Lei, X. Zhou, and X. Tang, “Secrecy performance evaluation of scalable cell-free massive MIMO systems: A stochastic geometry approach,” IEEE Trans. Inf. Forensics Security, vol. 18, pp. 2826–2841, 2023

  25. [25]

    Pilot assignment and power control in secure UA V-enabled cell-free massive MIMO networks,

    Y. Chen, X. Zhang, F. Yao, K. An, G. Zheng, and S. Chatzino- tas, “Pilot assignment and power control in secure UA V-enabled cell-free massive MIMO networks,” IEEE Internet Things J., vol. 11, no. 2, pp. 3377–3391, 2023

  26. [26]

    Per- formance of network-assisted full-duplex for cell-free massive MIMO,

    D. Wang, M. Wang, P. Zhu, J. Li, J. Wang, and X. You, “Per- formance of network-assisted full-duplex for cell-free massive MIMO,” IEEE Trans. Commun., vol. 68, no. 3, pp. 1464–1478, 2019

  27. [27]

    Joint user selection and transceiver design for cell- free with network-assisted full duplexing,

    X. Xia et al., “Joint user selection and transceiver design for cell- free with network-assisted full duplexing,” IEEE Trans. Wireless Commun., vol. 20, no. 12, pp. 7856–7870, 2021

  28. [28]

    Secure outage analysis of RIS-assisted communications with discrete phase control,

    W. Shi, J. Xu, W. Xu, M. Di Renzo, and C. Zhao, “Secure outage analysis of RIS-assisted communications with discrete phase control,” IEEE Trans. Veh. Technol., vol. 72, no. 4, pp. 5435–5440, Apr. 2022

  29. [29]

    Artificial noise- aided secure transmission for user-centric cell-free IoT network,

    X. Gao, Y. Li, L. Dong, W. Cheng, and G. Shi, “Artificial noise- aided secure transmission for user-centric cell-free IoT network,” IEEE Internet Things J., vol. 12, no. 6, pp. 7622–7635, 2025

  30. [30]

    On secrecy performance of RIS-assisted MISO sys- tems over Rician channels with spatially random eavesdrop- pers,

    W. Shi, J. Xu, W. Xu, C. Yuen, A. Lee Swindlehurst, and C. Zhao, “On secrecy performance of RIS-assisted MISO sys- tems over Rician channels with spatially random eavesdrop- pers,” IEEE Trans. Wireless Commun., vol. 23, no. 8, pp. 8357– 8371, Aug. 2024

  31. [31]

    Penalty dual decomposition method for nonsmooth nonconvex optimization—part I: Algorithms and convergence analysis,

    Q. Shi and M. Hong, “Penalty dual decomposition method for nonsmooth nonconvex optimization—part I: Algorithms and convergence analysis,” IEEE Trans. Signal Process., vol. 68, pp. 4108–4122, 2020

  32. [32]

    Grant and S

    M. Grant and S. Boyd, CVX: Matlab Software for Disciplined Convex Programming, 2018

  33. [33]

    A sequential para- metric convex approximation method with applications to nonconvex truss topology design problems,

    A. Beck, A. Ben-Tal, and L. Tetruashvili, “A sequential para- metric convex approximation method with applications to nonconvex truss topology design problems,” J. Global Optim., vol. 47, no. 1, pp. 29–51, 2010

  34. [34]

    Energy- efficient edge inference in integrated sensing, communication, and computation networks,

    J. Yao, W. Xu, G. Zhu, K. Huang, and S. Cui, “Energy- efficient edge inference in integrated sensing, communication, and computation networks,” IEEE J. Sel. Areas Commun., vol. 43, no. 10, pp. 3580–3595, Oct. 2025

  35. [35]

    X.-D., Matrix analysis and applications

    Z. X.-D., Matrix analysis and applications. Cambridge Uni- versity Press, 2017

  36. [36]

    Majorization- minimization algorithms in signal processing, communications, and machine learning,

    Y. Sun, P. Babu, and D. P. Palomar, “Majorization- minimization algorithms in signal processing, communications, and machine learning,” IEEE Trans. Signal Process., vol. 65, no. 3, pp. 794–816, 2017

  37. [37]

    Scalable cell-free massive MIMO systems,

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

  38. [38]

    Subarray-based coordinated beamforming training for mmWave and sub-THz communica- tions,

    C. Lin, G. Y. Li, and L. Wang, “Subarray-based coordinated beamforming training for mmWave and sub-THz communica- tions,” IEEE J. Sel. Areas Commun., vol. 35, no. 9, pp. 2115– 2126, 2017

  39. [39]

    Wireless federated learning over resource- constrained networks: Digital versus analog transmissions,

    J. Yao et al., “Wireless federated learning over resource- constrained networks: Digital versus analog transmissions,” IEEE Trans. Wireless Commun., vol. 23, no. 10, pp. 14 020– 14 036, Oct. 2024

  40. [40]

    G. H. Golub and C. F. Van Loan, Matrix Computations, 3rd ed. The Johns Hopkins Univ. Press, 1996