Pith. sign in

REVIEW 2 major objections 5 minor 41 references

Sum-Rate Maximization for Movable-Antenna Array Enhanced Downlink NOMA Systems

T0 review · 2 major / 5 minor · reviewed 2026-08-06 · deepseek-v4-flash

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

Pith's one-line read Movable antennas at the base station, jointly optimized with beamforming and adaptive decoding, raise downlink NOMA sum rate by up to 42.6 percent over fixed-antenna baselines in simulation.

desk verdict A solid algorithm-and-simulation paper for BS-side movable-antenna NOMA; the load-bearing catch is an unverified rank-one SDR guarantee cited from an IRS-NOMA paper. read the letter →

arxiv 2507.15555 v1 pith:IFHHFUHM submitted 2025-07-21 eess.SP

Nianzu Li , Peiran Wu , Lipeng Zhu , Weidong Mei , Boyu Ning , Derrick Wing Kwan Ng This is my paper · ORCID
classification eess.SP
keywords movableantennadownlinkNOMAsum-ratemaximizationjointbeamformingandpositiondesignSICdecodingorderadaptivesuccessiveconvexapproximationgeneticalgorithm
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 tries to establish that moving the antennas at a base station can make non-orthogonal multiple access (NOMA) more effective than fixed-position antennas and space-division multiple access (SDMA). It formulates a sum-rate maximization that jointly chooses beamforming vectors, antenna positions, the SIC decoding order, and a binary indicator matrix deciding which users decode which signals, subject to power, movement-region, and antenna-spacing constraints. Because the problem is non-convex and combinatorial, the paper proposes a two-stage algorithm: first fix the SIC order by maximizing summed channel gains through alternating successive convex approximation, then alternately update beamformers, one antenna position at a time, and the decoding indicator matrix via a genetic algorithm. Simulations show the movable-antenna NOMA design outperforms fixed-antenna NOMA and both SDMA variants, with reported gains of 18.2%, 28.6%, and 42.6% over SDMA-MA, NOMA-FPA, and SDMA-FPA at M=4 and K=6. The paper concludes that antenna position optimization strengthens the rate advantage of NOMA over SDMA.

What carries the argument

The load-bearing objects are the field-response vector/matrix representation of the channel and the two-stage alternating-optimization decomposition. In the field-response model, the channel from the MA array to user $k$ is written as $h_k(\tilde{\mathbf u}) = \mathbf G_k^H(\tilde{\mathbf u}) \mathbf f_k$, where $\mathbf G_k$ is built from phase-rotated field-response vectors per antenna, so every quantity in the problem has closed-form gradients and Hessians with respect to an antenna position $\mathbf u_m$. That structure lets the algorithm replace non-concave objectives and non-convex constraints with quadratic surrogates via successive convex approximation, and lets the beamforming subproblem be cast as a semidefinite program whose rank-one constraint is dropped on the strength of a cited rank-one theorem. The discrete decoding indicator matrix is handled separately by a genetic algorithm, so the overall procedure alternates between continuous optimization and combinatorial search.

What would settle it

Solve the beamforming subproblem without the rank-one constraint on many random channel realizations and check whether every optimal matrix has rank one; any realization with a higher-rank optimal matrix whose recovered beamformer loses sum rate or violates the minimum-rate constraints would show the relaxation is not exact.

Watch

Extended reading notes

Core claim

The central claim is that deploying multiple movable antennas at the base station and optimizing their positions jointly with transmit beamforming, the SIC decoding order, and adaptive per-user decoding yields a higher downlink sum rate than fixed-position antenna arrays under the same transmit power budget. In the paper's own terms, the field-response channel model makes each user's channel a deterministic function of the antenna position vector, so repositioning antennas reconfigures channel gains and channel disparities; the two-stage algorithm exploits this by first maximizing the summed channel gains to fix a SIC order, then alternating between a semidefinite-relaxation beamforming step, an SCA-based antenna-position update for each antenna, and a genetic-algorithm search over the decoding indicator matrix. The paper argues that the resulting suboptimal solution converges monotonically, approaches exhaustive search for both the SIC order and the decoding indicators, and produces the reported sum-rate gains. The key mechanism it identifies is that antenna movement amplifies the channel differences that NOMA's SIC can exploit, which is why the NOMA-over-SDMA gap becomes larger with movable antennas than with fixed antennas.

Load-bearing premise

The beamforming step assumes that a relaxed version of the problem always has a rank-one optimal solution, so the rank constraint can be dropped and beamformers recovered by eigenvalue decomposition without loss; if that assumption fails, the recovered beamformers may be infeasible or poor.

Editorial extensions

If this is right

  • For M=4 and K=6, the proposed MA-NOMA scheme raises average sum rate by 18.2% over SDMA-MA, 28.6% over NOMA-FPA, and 42.6% over SDMA-FPA.
  • Optimizing antenna positions improves each user's channel gain and widens channel disparities, which strengthens the sum-rate advantage of NOMA over SDMA.
  • The channel-gain-maximization SIC ordering from Algorithm 1 performs close to exhaustive search, and the GA-based decoding indicator from Algorithm 2 performs close to exhaustive search.
  • The two-stage algorithm converges monotonically in both stages, with the second stage raising the tested average sum rate from 5.85 to 10.60 bps/Hz.
  • At a fixed sum-rate target, the MA-NOMA design requires less transmit power than all three benchmark schemes in the simulated settings.

Reading between the lines

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

  • An untested extension is how sensitive the gains are to imperfect channel state information; the same alternating SCA-plus-GA template could be adapted to estimated channels, but the paper assumes perfect CSI.
  • The rank-one relaxation used in the beamforming step is only as safe as the cited theorem's applicability; a rank-distribution simulation over random channels would reveal how often the eigenvalue-decomposition step produces near-feasible beamformers.
  • Since the paper observes that NOMA's edge over SDMA narrows as the number of antennas grows, the practical sweet spot for this design appears to be arrays with M at or below the number of users, though the paper does not state this as a design rule.
  • The paper's adaptive decoding indicator could be interpreted as a discrete generalization of conventional NOMA, suggesting that other combinatorial decoding structures, such as partial interference cancellation, might be optimized with the same genetic-algorithm machinery.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 5 minor

Summary. The paper studies a downlink MISO-NOMA system where the base station is equipped with movable antennas (MAs) serving single-antenna users. The authors formulate a sum-rate maximization problem that jointly optimizes transmit beamforming, MA positions, SIC decoding order, and an adaptive decoding indicator matrix, subject to power, QoS, and antenna-spacing constraints. They propose a two-stage algorithm: stage one determines the SIC order by maximizing overall channel gains; stage two alternately optimizes beamformers (via SDP/SCA), MA positions (via SCA), and the decoding indicator matrix (via GA). Simulation results report gains of 18.2%, 28.6%, and 42.6% over SDMA-MA, NOMA-FPA, and SDMA-FPA at M=4, K=6.

Significance. If the algorithm's convergence and feasibility guarantees were fully established, the work would be a useful contribution to MA-assisted NOMA resource allocation, especially the adaptive SIC formulation with decoding indicators and the two-stage decomposition. The SCA surrogates in (11), (24), and (26) are derived from first principles with closed-form gradients and Hessians, which is a strength. The simulation study is extensive and the comparison with exhaustive search for small K is informative. However, two load-bearing gaps--the unverified rank-one relaxation and the missing positivity constraints on the slack variables--currently prevent the reported gains from being considered fully reproducible.

major comments (2)
  1. [III-B1, around (22)] The rank-one constraint (19f) is dropped based on Theorem 1 of [37] without verifying that the conditions of that theorem hold for problem (22). Problem (22) is a sum-rate SDP with O(K^2) slack constraints (19b)-(19c) and the SCA constraint (21), which is structurally different from the IRS-NOMA beamforming problem in [37]. Standard rank-reduction arguments would only guarantee a rank r with r(r+1)/2 bounded by the number of constraints, which for K=6 gives about 100 constraints and does not force r=1. If the SDP returns a higher-rank solution, the eigenvalue decomposition step in Section III-B1 can yield beamformers that violate the QoS constraints (17e) or the SINR-related bounds (19b)-(19c), and the stated monotone convergence of Algorithm 3 is not assured. Please provide numerical evidence of rank-one tightness (e.g., distribution of the ranks of the SDP solutions) or replace the extraction step with a rank-one restoration procedure with feasibility checks.
  2. [II-C and III-B, equations (18)-(19)] The reformulation does not explicitly restrict the slack variables alpha_{k,i} and beta_{k,i} to be nonnegative. Without alpha_{k,i} >= 0, constraint (19b) can be satisfied with alpha_{k,i} arbitrarily negative while beta_{k,i} remains positive, making the SCA surrogate in (20) unbounded above and the relaxed problem (22) unbounded. The equivalence between (17) and (18) therefore requires explicit domain constraints; please add alpha_{k,i} >= 0, beta_{k,i} >= 0 (or equivalently state that the log2 argument is defined) and re-confirm that the SCA lower bound (20) is valid over this feasible set.
minor comments (5)
  1. [Section IV-C] The benchmark description says 'FAP-based uniform planar array' in the NOMA-FPA and SDMA-FPA entries; this should be 'FPA-based'.
  2. [Appendix B, equations (44a)-(44c)] In the Hessian expressions for Gamma_{k,i}(u_m), the path-count index appears as L_k on the first summation in (44a)-(44c); since Gamma_{k,i} depends on the channel h_i, these sums should be over L_i. Please check the subscript consistency.
  3. [Fig. 2(a)] The y-axis label 'Average normalized channel gain (dB)' appears inconsistent with the plotted values, which range from 0 to about 1.6; please relabel to match the displayed quantity.
  4. [Equation (32)] The penalty term uses the norm of the set P(G_g^{(v)}), but the norm is not defined; if the cardinality is intended, please state it explicitly.
  5. [Algorithm 1 complexity] The complexity expression O(KL^2_k) is ambiguous; use O(K L_k^2) or define the notation for the path count.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the two-stage algorithm optimizes the stated sum-rate problem from the channel model; the only cited theorem is external, and any unverified applicability is a correctness risk, not a circular construction.

full rationale

The derivation chain is self-contained relative to the problem formulation. The SIC order in stage one is determined by maximizing the sum of channel gains (problem (9)) and sorting users by their channel norms (16); it is a heuristic that depends on channel gains, not on the final sum-rate objective, and the paper separately benchmarks it against exhaustive order in Section IV-D. Stage two solves the beamforming subproblem (22), the per-antenna position subproblem (29), and the decoding-indicator problem (30) as independent optimization blocks; no fitted parameter is introduced and later reported as a prediction. The only load-bearing external dependence is the rank-one guarantee for the SDR of problem (22), attributed to Theorem 1 of [37]. [37] is not authored by the present authors, so this is not a self-citation chain, and the paper makes no attempt to define the rank-one constraint in terms of its own outputs. If Theorem 1 does not extend to the sum-rate SDP with slack constraints (19b)-(19c), the eigenvalue-decomposition step could fail, but that is an unverified applicability/soundness concern, not an equivalence-by-construction between inputs and outputs. Thus no circular step meeting the required evidentiary standard can be exhibited.

Assumptions & free parameters 1 free parameters · 4 assumptions · 0 invented entities

The algorithm introduces no fitted free parameters; the GA hyperparameters are hand-chosen. The derivation relies on the field-response channel model, perfect CSI, Taylor-series SCA surrogates, and an external rank-one theorem cited from [37] without condition verification.

free parameters (1)
  • GA hyperparameters (G, tau, pc, pm, Vmax) = G=100, tau=100, pc=0.5, pm=0.1, Vmax=200
    Chosen by hand in Section IV-A; they affect the quality of the heuristic decoding indicator optimization but are not fitted to data.
assumptions (4)
  • domain assumption Field-response channel model under far-field conditions (Eq. 2-3) with known AoDs and path responses
    The entire channel model is based on the field-response representation; the paper assumes perfect knowledge of all path parameters at the BS (Section II-A, II-C).
  • domain assumption Perfect CSI available at the BS for resource allocation
    Stated in Section II-C: 'we assume that the channel state information (CSI) of all involved links is available at the BS for resource allocation design.'
  • standard math Theorem 1 in [37] applies to problem (22) and guarantees rank-one SDR solutions
    The paper relies on this external theorem to drop the rank-one constraint without verifying its conditions; the theorem is from Mu et al., IEEE TWC 2020, for IRS-NOMA beamforming.
  • standard math Taylor's theorem and SCA surrogates in (11), (24), (26) are valid global lower or upper bounds
    The paper uses these to convexify the non-convex constraints; requires bounded Hessians, which are computed via Frobenius norms.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sum-Rate Maximization for Movable-Antenna Array Enhanced Downlink NOMA Systems." pith.science (2026). https://pith.science/paper/IFHHFUHM

@misc{pith2026250715555,
  author       = {Pith},
  title        = {Pith review of: Sum-Rate Maximization for Movable-Antenna Array Enhanced Downlink NOMA Systems},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IFHHFUHM}},
  note         = {Machine review of arXiv:2507.15555}
}
read the original abstract

Movable antenna (MA) systems have recently attracted significant attention in the field of wireless communications owing to their exceptional capability to proactively reconfigure wireless channels via flexible antenna movements. In this paper, we investigate the resource allocation design for an MA array-enhanced downlink non-orthogonal multiple access (NOMA) system, where a base station deploys multiple MAs to serve multiple single-antenna users. Our goal is to maximize the sum rate of all users by jointly optimizing the transmit beamforming, positions of MAs, successive interference cancellation (SIC) decoding order, and users' corresponding decoding indicator matrix, while adhering to constraints on the maximum transmit power and finite MA moving region. The formulated problem is inherently highly non-convex, rendering it challenging to acquire a globally optimal solution. As a compromise, we propose a low-complexity two-stage optimization algorithm to obtain an effective suboptimal solution. Specifically, in stage one, the SIC decoding order is first determined by solving a channel gain maximization problem. Then, in stage two, with the given SIC decoding order, the beamforming vectors, MA positions, and users' decoding indicator matrix are iteratively optimized by capitalizing on alternating optimization, successive convex approximation (SCA), and genetic algorithm (GA). Simulation results unveil that the sum-rate performance of the proposed MA-enabled downlink NOMA system significantly outperforms that of conventional fixed-position antenna (FPA) systems. Moreover, the results also show that the antenna position optimization in the proposed algorithm can further enhance the advantages of NOMA over space division multiple access (SDMA).

Figures

Figures reproduced from arXiv: 2507.15555 by the authors.

Figure 1
Figure 1. Illustration of the MA-enhanced downlink MISO-NOMA system. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Evaluation of the convergence performance of our proposed two-stage [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 5
Figure 5. Average sum rate of different schemes versus the maximum transmit [PITH_FULL_IMAGE:figures/full_fig_p010_5.png] view at source ↗
Figures from the paper (1 more)
Figure 7
Figure 7. Figure 7: Average sum rate of different decoding indicators versus the number [PITH_FULL_IMAGE:figures/full_fig_p011_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

41 extracted references · 32 canonical work pages

  1. [37]

    Exploiting intelligent reflecting surfaces in NOMA networks: Joint beamforming optimization,

    X. Mu et al. , “Exploiting intelligent reflecting surfaces in NOMA networks: Joint beamforming optimization,” IEEE Trans. Wireless Com- mun., vol. 19, no. 10, pp. 6884–6898, 2020

    work page 2020

  2. [35]

    Movable Antenna Aided NOMA: Joint Antenna Positioning, Precoding, and Decoding Design

    Z. Xiao, Z. Li, L. Zhu, B. Ning, D. B. da Costa, X.-G. Xia, and R. Zhang, “Movable antenna aided NOMA: Joint antenna positioning, precoding, and decoding design,” arXiv:2412.12531, 2024

    work page Pith review arXiv 2024

  3. [1]

    Movable-antenna array enhanced downlink NOMA,

    N. Li, P. Wu, L. Zhu, and D. W. K. Ng, “Movable-antenna array enhanced downlink NOMA,” to be presented in IEEE ICC Workshops , Montreal, Canada, 2025

    work page 2025

  4. [2]

    On the road to 6G: Visions, requirements, key technologies, and testbeds,

    C.-X. Wang et al. , “On the road to 6G: Visions, requirements, key technologies, and testbeds,” IEEE Commun. Surveys Tuts., vol. 25, no. 2, pp. 905–974, 2023

    work page 2023

  5. [3]

    The road towards 6G: A comprehensive survey,

    W. Jiang, B. Han, M. A. Habibi, and H. D. Schotten, “The road towards 6G: A comprehensive survey,” IEEE Open J. Commun. Soc. , vol. 2, pp. 334–366, 2021

    2021

  6. [4]

    Beamforming technologies for ultra-massive MIMO in terahertz communications,

    B. Ning et al. , “Beamforming technologies for ultra-massive MIMO in terahertz communications,” IEEE Open J. Commun. Soc. , vol. 4, pp. 614–658, 2023

    work page 2023

  7. [5]

    A survey of non-orthogonal multiple access for 5G,

    L. Dai, B. Wang, Z. Ding, Z. Wang, S. Chen, and L. Hanzo, “A survey of non-orthogonal multiple access for 5G,” IEEE Commun. Surveys Tuts. , vol. 20, no. 3, pp. 2294–2323, 2018

    work page 2018

  8. [6]

    A tutorial on movable antennas for wireless networks,

    L. Zhu et al. , “A tutorial on movable antennas for wireless networks,” IEEE Commun. Surveys Tuts. , 2025, early access

    work page 2025

Show all 41 references
  1. [7]

    Movable antennas for wireless commu- nication: Opportunities and challenges,

    L. Zhu, W. Ma, and R. Zhang, “Movable antennas for wireless commu- nication: Opportunities and challenges,” IEEE Commun. Mag. , vol. 62, no. 6, pp. 114–120, Jun. 2024

    2024

  2. [8]

    Movable antenna-enhanced wireless communications: General architectures and implementation methods,

    B. Ning et al. , “Movable antenna-enhanced wireless communications: General architectures and implementation methods,” IEEE Wireless Commun., 2025, early access

    2025

  3. [9]

    Single antenna spatial diversity,

    S. Zhao, H. Yang, and H. Yang, “Single antenna spatial diversity,” in 5th International Conference on Wireless Communications, Networking and Mobile Computing , 2009, pp. 1–4

    2009

  4. [10]

    Revisiting outage probability analysis for two-user fluid antenna multiple access system,

    H. Xu et al. , “Revisiting outage probability analysis for two-user fluid antenna multiple access system,” IEEE Trans. Wireless Commun. , vol. 23, no. 8, pp. 9534–9548, 2024

    2024

  5. [11]

    Cell-free fluid antenna multiple access networks,

    T. Han, Y . Zhu, K.-K. Wong, G. Zheng, and H. Shin, “Cell-free fluid antenna multiple access networks,” IEEE Trans. Wireless Commun. , 2025, early access

    2025

  6. [12]

    Flexible-antenna systems: A pinching-antenna perspective,

    Z. Ding, R. Schober, and H. Vincent Poor, “Flexible-antenna systems: A pinching-antenna perspective,” IEEE Trans. Commun. , 2025, early access

    2025

  7. [13]

    Sum-rate max- imization for pinching antenna-assisted NOMA systems with multiple dielectric waveguides,

    S. Hu, R. Zhao, Y . Liao, D. W. K. Ng, and J. Yuan, “Sum-rate max- imization for pinching antenna-assisted NOMA systems with multiple dielectric waveguides,” arXiv:2503.10060, 2025

    2025

  8. [14]

    Movable-antenna array enhanced beam- forming: Achieving full array gain with null steering,

    L. Zhu, W. Ma, and R. Zhang, “Movable-antenna array enhanced beam- forming: Achieving full array gain with null steering,” IEEE Commun. Lett., vol. 27, no. 12, pp. 3340–3344, 2023

    2023

  9. [15]

    Pinching- antenna systems (PASS): Architecture designs, opportunities, and out- look,

    Y . Liu, Z. Wang, X. Mu, C. Ouyang, X. Xu, and Z. Ding, “Pinching- antenna systems (PASS): Architecture designs, opportunities, and out- look,” arXiv:2501.18409, 2025

    2025 arXiv

  10. [16]

    Modeling and performance analysis for movable antenna enabled wireless communications,

    L. Zhu, W. Ma, and R. Zhang, “Modeling and performance analysis for movable antenna enabled wireless communications,” IEEE Trans. Wireless Commun., vol. 23, no. 6, pp. 6234–6250, Jun. 2024

    2024

  11. [17]

    Fluid antenna system: New insights on outage probability and diversity gain,

    W. K. New, K.-K. Wong, H. Xu, K.-F. Tong, and C.-B. Chae, “Fluid antenna system: New insights on outage probability and diversity gain,” IEEE Trans. Wireless Commun. , vol. 23, no. 1, pp. 128–140, 2024

    2024

  12. [18]

    Movable-antenna position optimization: A graph-based approach,

    W. Mei et al. , “Movable-antenna position optimization: A graph-based approach,” IEEE Wireless Commun. Lett. , vol. 13, no. 7, pp. 1853–1857, Jul. 2024

    2024

  13. [19]

    Robust movable-antenna position optimization with imperfect CSI for MISO systems,

    H. Ma et al. , “Robust movable-antenna position optimization with imperfect CSI for MISO systems,” IEEE Commun. Lett. , 2025, early access

    2025

  14. [20]

    Rate maximization for downlink pinching-antenna systems,

    Y . Xu, Z. Ding, and G. K. Karagiannidis, “Rate maximization for downlink pinching-antenna systems,” IEEE Wireless Commun. Lett. , 2025, early access

    2025

  15. [21]

    MIMO capacity characterization for movable antenna systems,

    W. Ma, L. Zhu, and R. Zhang, “MIMO capacity characterization for movable antenna systems,” IEEE Trans. Wireless Commun. , vol. 23, no. 4, pp. 3392–3407, Apr. 2024

    2024

  16. [22]

    Movable-antenna enhanced multiuser communication via antenna position optimization,

    L. Zhu et al., “Movable-antenna enhanced multiuser communication via antenna position optimization,” IEEE Trans. Wireless Commun., vol. 23, no. 7, pp. 7214–7229, Jul. 2024

    2024

  17. [23]

    6D movable antenna based on user distribution: Modeling and optimization,

    X. Shao, Q. Jiang, and R. Zhang, “6D movable antenna based on user distribution: Modeling and optimization,” IEEE Trans. Wireless Commun., vol. 24, no. 1, pp. 355–370, 2025

    2025

  18. [24]

    Two-timescale design for movable antenna array-enabled multiuser uplink communications,

    G. Hu et al. , “Two-timescale design for movable antenna array-enabled multiuser uplink communications,” IEEE Trans. V eh. Technol., vol. 74, no. 3, pp. 5152–5157, 2025

    2025

  19. [25]

    Movable antenna enabled integrated sensing and commu- nication,

    W. Lyu et al., “Movable antenna enabled integrated sensing and commu- nication,” IEEE Trans. Wireless Commun., vol. 24, no. 4, pp. 2862–2875, 2025

    2025

  20. [26]

    Fluid antenna system liberating multiuser MIMO for ISAC via deep reinforcement learning,

    C. Wang et al. , “Fluid antenna system liberating multiuser MIMO for ISAC via deep reinforcement learning,” IEEE Trans. Wireless Commun., vol. 23, no. 9, pp. 10 879–10 894, 2024

    2024

  21. [27]

    Down- link beamforming with pinching-antenna assisted MIMO systems,

    A. Bereyhi, S. Asaad, C. Ouyang, Z. Ding, and H. V . Poor, “Down- link beamforming with pinching-antenna assisted MIMO systems,” arXiv:2502.01590, 2025

    2025 arXiv

  22. [28]

    Over-the-air computation via 2-D movable antenna array,

    N. Li, P. Wu, B. Ning, L. Zhu, and W. Mei, “Over-the-air computation via 2-D movable antenna array,” IEEE Wireless Commun. Lett. , vol. 14, no. 1, pp. 33–37, 2025

    2025

  23. [29]

    Joint transmitter and receiver design for movable antenna enhanced multicast communications,

    Y . Gao, Q. Wu, and W. Chen, “Joint transmitter and receiver design for movable antenna enhanced multicast communications,” IEEE Trans. Wireless Commun., vol. 23, no. 12, pp. 18 186–18 200, 2024

    2024

  24. [30]

    Physical layer security over fluid antenna sys- tems: Secrecy performance analysis,

    F. Rostami Ghadi et al., “Physical layer security over fluid antenna sys- tems: Secrecy performance analysis,” IEEE Trans. Wireless Commun. , vol. 23, no. 12, pp. 18 201–18 213, 2024

    2024

  25. [31]

    Movable antenna-aided secure full-duplex multi-user communications,

    J. Ding, Z. Zhou, and B. Jiao, “Movable antenna-aided secure full-duplex multi-user communications,” IEEE Trans. Wireless Commun. , vol. 24, no. 3, pp. 2389–2403, 2025

    2025

  26. [32]

    Secure MIMO communication relying on movable antennas,

    J. Tang, C. Pan, Y . Zhang, H. Ren, and K. Wang, “Secure MIMO communication relying on movable antennas,” IEEE Trans. Commun. , vol. 73, no. 4, pp. 2159–2175, 2025

    2025

  27. [33]

    Movable antennas-assisted secure transmission without eavesdroppers’ instantaneous CSI,

    G. Hu, Q. Wu, D. Xu, K. Xu, J. Si, Y . Cai, and N. Al-Dhahir, “Movable antennas-assisted secure transmission without eavesdroppers’ instantaneous CSI,” IEEE Trans. Mobile Comput. , vol. 23, no. 12, pp. 14 263–14 279, 2024

    2024

  28. [34]

    Movable antenna empowered downlink NOMA systems: Power allocation and antenna position optimization,

    Y . Zhou et al., “Movable antenna empowered downlink NOMA systems: Power allocation and antenna position optimization,” IEEE Wireless Commun. Lett. , vol. 13, no. 10, pp. 2772–2776, 2024

    2024

  29. [36]

    Sum rate maximization for movable antenna enabled uplink NOMA,

    N. Li, P. Wu, B. Ning, and L. Zhu, “Sum rate maximization for movable antenna enabled uplink NOMA,” IEEE Wireless Commun. Lett. , vol. 13, no. 8, pp. 2140–2144, Aug. 2024

    2024

  30. [38]

    Millimeter-wave NOMA with user grouping, power allocation and hybrid beamforming,

    L. Zhu et al. , “Millimeter-wave NOMA with user grouping, power allocation and hybrid beamforming,” IEEE Trans. Wireless Commun. , vol. 18, no. 11, pp. 5065–5079, 2019

    2019

  31. [39]

    Multiuser communications with movable-antenna base station: Joint antenna positioning, receive combining, and power con- trol,

    Z. Xiao et al. , “Multiuser communications with movable-antenna base station: Joint antenna positioning, receive combining, and power con- trol,” IEEE Trans. Wireless Commun., vol. 23, no. 12, pp. 19 744–19 759, 2024

    2024

  32. [40]

    Boyd and L

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

    2004

  33. [41]

    D. R. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning . New York, NY , USA: Addison Wesley, 1989

    1989

Pith tools

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