Pith. sign in

REVIEW 3 major objections 6 minor 40 references

Efficient Discrete Position Design for Movable Antenna Systems: Low Complexity and Robustness

T0 review · 3 major / 6 minor · reviewed 2026-08-15 · deepseek-v4-flash

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

Pith's one-line read Discrete movable-antenna placement is submodular; greedy search carries a 1/3 guarantee.

desk verdict A mostly sound submodularity framework for discrete MA placement; the 1/3 guarantee is real but the paper should explicitly handle the cardinality constraint. read the letter →

arxiv 2608.07413 v1 pith:7LMDUBTT submitted 2026-08-07 cs.IT eess.SPmath.IT

Haonan Wang , Xianghao Yu , Rui Wang , Ang Li , Ying-Jun Angela Zhang This is my paper · ORCID
classification cs.ITeess.SPmath.IT
keywords movableantennasdiscretepositiondesignmutualinformationmaximizationsubmodularoptimization2-systemconstraintgreedyalgorithmrobustMU-MIMOuplink
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

The paper asks where to place a handful of movable antennas at a base station among a discrete grid of candidate slots, with the goal of maximizing the mutual information of the uplink multi-user MIMO channel. It establishes that this placement problem is a monotone submodular maximization under a 2-system constraint, so the natural greedy rule—each step add the feasible slot with the largest incremental MI gain while keeping a minimum spacing between antennas—is guaranteed to deliver at least one-third of the optimal MI. The argument is carried by a codebook channel model in which each slot's response is fixed and the selected channel is simply the corresponding columns of a precomputed matrix. The same framework is extended to imperfect channel knowledge by maximizing a Jensen-based surrogate that keeps submodularity and the one-third guarantee. If the claim holds, an NP-hard combinatorial antenna placement becomes a polynomial-time design with a formal worst-case bound and near-optimal performance in simulations.

What carries the argument

The load-bearing object is the incremental-gain formula $\Delta(v|S)=\log_2\left(1+\rho w(v)^H A_S w(v)\right)$, with $A_S=\left(I_{KN_U}+\rho \sum_{u\in S} w(u)w(u)^H\right)^{-1}$, where $w(v)=G^H\Sigma^H f(v)$ is the fixed channel response of candidate slot $v$. This formula makes MI gains additive through rank-one updates, and since adding a slot shrinks $A_S$ in the Lowner order, incremental gains decrease with larger sets—diminishing returns, i.e., submodularity. The 2-system is the independence family of slot sets with pairwise spacing at least $N_D$; the proof that any two maximal independent sets in a subset differ by at most a factor of two uses the fact that each selected slot's radius-$N_D$ neighborhood can contain at most two points of another valid placement. The greedy algorithm maximizes $\Delta(v|S)$ over feasible remaining slots at each step.

What would settle it

Enumerate every feasible position set for a small instance (e.g., $N_{BS}=4$, $N_S=30$) and compare the DCSPS output with the true optimum: any ratio below $1/3$ disproves the guarantee. Equivalently, run a full-wave simulation of two antennas at spacing $N_D$ and check whether the incremental MI gain of adding a slot to a larger nested set ever exceeds the gain for a smaller set, which would violate submodularity.

Watch

Extended reading notes

Core claim

Central claim: with perfect CSI, the mutual information $c(S)=\log_2\det\left(I_{|S|}+\rho H_S H_S^H\right)$ is a monotone submodular set function over candidate slots, and the family of position sets satisfying the minimum-spacing constraint $|i-j|\ge N_D$ is a 2-system. Therefore the distance-constrained submodular position search (DCSPS) greedy algorithm achieves at least $1/3$ of the optimal MI. With imperfect CSI, the expected-MI objective is replaced by a deterministic Jensen surrogate $c_r(S)=\log_2\det\left(I_{|S|}+\rho \tilde{H}_S \tilde{H}_S^H\right)$, where $\tilde{H}_S=[E_S,\hat{H}_S]$ appends the square root of the estimation-error covariance as virtual columns; this surrogate is still monotone submodular, so the robust DCSPS preserves the $1/3$ bound for the surrogate. The paper further reports that DCSPS reaches at least 90% of the optimal MI gain in simulations at polynomial complexity, running 34.4 times faster than branch-and-bound.

Load-bearing premise

The load-bearing premise is that each candidate slot's channel response $w(v)$ is fixed regardless of which other slots are selected—the minimum-spacing constraint is taken to eliminate mutual coupling—so if residual electromagnetic coupling at the chosen spacing changes an antenna's response when a neighbor moves, the codebook model $H_S=\bar{F}_S^H\Sigma G$ and the submodularity proof collapse.

Editorial extensions

If this is right

  • DCSPS returns a position set whose MI is at least $1/3$ of the optimum with complexity $O(N_S N_{BS}^4)$, replacing exponential branch-and-bound.
  • In imperfect-CSI settings, R-DCSPS retains the same guarantee for the surrogate objective while needing no Monte Carlo averaging per candidate.
  • The Jensen surrogate's virtual-channel interpretation says estimation error consumes $N_{BS}$ spatial degrees of freedom as virtual users, so the MI loss from imperfect CSI is structural rather than a numerical artifact.
  • Aperture expansion matters more than increasing the number of grid slots for MI gains; the gain saturates at the continuous-MA upper bound.
  • The MI-based greedy criterion outperforms channel-gain greedy, random feasible placement, and equidistant placement, so spatial-DoF projection, not aperture alone, is the source of the gain.

Reading between the lines

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

  • If residual mutual coupling at the minimum spacing is non-negligible, the fixed-slot response assumption fails; an immediate test is to recompute the embedded element patterns with neighboring antennas present and check whether the diminishing-returns inequality still holds.
  • The virtual-user view of channel estimation error suggests a design rule: the number of virtual columns equals $N_{BS}$, so error-aware placement should reserve spatial dimensions for estimation uncertainty; this could be tested by comparing R-DCSPS with a scheme that optimizes the number of active streams.
  • The $1/3$ bound is worst-case; if a planar-array extension keeps the independence system a bounded $k$-system, the same submodular machinery could support tighter guarantees via curvature.
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.

Referee Report

3 major / 6 minor

Summary. The paper considers discrete movable-antenna (MA) position design at the base station of an uplink multi-user MIMO system. It formulates a mutual-information (MI) maximization problem over a finite set of candidate positions, subject to a minimum-spacing constraint and the exact selection of N_BS positions. The authors prove that the MI objective is monotone submodular (Lemma 2), show that the spacing-only feasible family is a 2-system (Lemma 3), and propose a greedy algorithm (DCSPS) with a claimed 1/3-approximation guarantee. They then extend the framework to imperfect CSI by replacing the expected MI with a deterministic Jensen surrogate, yielding an R-DCSPS algorithm with the same nominal guarantee for the surrogate objective. Numerical experiments compare the proposed schemes against branch-and-bound, channel-gain greedy, equidistant, random, and fixed-antenna baselines, reporting near-optimal MI and orders-of-magnitude runtime reductions.

Significance. If the 1/3 approximation claim is fully established, this is a significant contribution to the discrete-MA literature: it provides a polynomial-time design algorithm with a formal worst-case guarantee, a clean submodularity proof, and an extensive numerical study. The paper's treatment of imperfect CSI via a closed-form surrogate and the 'virtual user' interpretation of estimation error are also interesting and go beyond the commonly used exhaustive-search baselines. The paper is carefully written and the simulation suite is broad, including complexity scaling, aperture effects, and practical transceiver comparisons.

major comments (3)
  1. [Sec. IV, Lemma 3 and problem P3] The claimed 1/3 guarantee for problem P3 is not fully proved. Lemma 3 establishes that the spacing-only independence system I = {S ⊆ W : |i−j| ≥ N_D for all i,j ∈ S} is a 2-system, but P3 additionally imposes the exact-cardinality constraint |S| = N_BS. The paper never proves that the capped family I_{≤N_BS} = {S ∈ I : |S| ≤ N_BS} is a 2-system, nor does it explain how the cardinality constraint interacts with the k-system greedy theorem. The gap is repairable: the truncation of a k-system at rank r is again a k-system, and the greedy guarantee against the relaxed problem (with |S| ≤ N_BS) implies the same guarantee against the exact-cardinality optimum because the relaxed optimum upper-bounds the constrained optimum. However, the paper should state this argument explicitly; as written, the statement 'the design problem falls into the category of monotone submodular maximization subject to a 2-system constraint' is not directly justified for the exact-cardinality problem since the exact-cardinality family is not hereditary.
  2. [Algorithm 1, line 8] The validity check in Algorithm 1 rejects a candidate position j when min_{s∈S} |s−j| ≤ N_D, which enforces the strict inequality |s−j| > N_D. The constraint C3 of P3 requires |s−j| ≥ N_D, so positions at exactly distance N_D are feasible but are excluded by the algorithm. This means the algorithm searches over a strictly smaller feasible family than the one for which the 2-system and the greedy guarantee are established. The condition should be '< N_D' (or equivalently reject only when min |s−j| < N_D) to match the problem definition.
  3. [Sec. V, Eq. (49)-Eq. (51)] The robust surrogate c_r(S) is claimed to be monotone submodular 'based on our derivation in Sec. IV', but the paper does not explicitly define the per-position channel vectors for the virtual channel ~H_S. To apply Lemma 1 and Lemma 2 one needs to write c_r(S) = log2 det(I + ρ Σ_{u∈S} ~w(u)~w(u)^H) with fixed vectors ~w(u) in dimension N_BS+KN_U, and then note that the positivity and rank-one update arguments carry over unchanged. This step is a short derivation, but it should be included because the reader cannot otherwise verify that the monotone submodularity of the surrogate is truly inherited from Sec. IV despite the enlarged column dimension.
minor comments (6)
  1. [Lemma 3 proof] The displayed equality |I| = Σ_{x∈J} |I ∩ B_x| is not justified because the neighborhoods B_x may overlap; the correct statement is an inequality |I| ≤ Σ_{x∈J} |I ∩ B_x|. The subsequent bound |I| ≤ 2|J| remains valid, so the lemma's conclusion is unaffected.
  2. [Definition 3] The definition of a k-system uses both S and A for the subset in condition 3; this is confusing. Please use a single symbol, e.g., 'for any subset S ⊆ V' throughout.
  3. [Reference [30]] Reference [30] (Petersen, 'A stabilization algorithm for a class of uncertain linear systems') does not appear related to submodularity or to the definition of submodular functions. Please check the citation and replace it with a standard submodularity reference.
  4. [Sec. IV-D complexity analysis] The complexity claim O(N_S N_BS^4) is plausible but not derived. Since the determinant update in Algorithm 1 may be implemented with a rank-one matrix determinant lemma, the per-evaluation cost should be O(N_BS^2) or O(N_BS^3) depending on the implementation; a short derivation of the stated exponent would improve the paper.
  5. [Abstract and Sec. VI] The phrase 'achieve at least 90% of the optimal solution's MI gain' can be read as 90% of the absolute MI. The numerical evidence supports it for the MI gain over the fixed half-wavelength benchmark (e.g., Fig. 7: DCSPS gain 3.280 bits/s/Hz vs BnB gain 3.517 bits/s/Hz, about 93%). Please clarify in the text or captions that the 90% refers to the gain over the benchmark, not the absolute MI.
  6. [Sec. V-B, Eq. (51)] The virtual channel matrix ~H_S is defined as [E_S, Yhat H_S], but it is not stated that its column dimension is N_BS + K N_U and that this dimension is independent of S. This observation is needed for the submodularity argument.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: submodularity and the 1/3 guarantee are derived in-paper from standard external theorems; the only in-paper self-citation [1] is a provenance note, not load-bearing.

full rationale

The central claim is that P3 is monotone submodular maximization under a 2-system constraint, giving the DCSPS greedy algorithm a 1/3 approximation ratio. This chain is self-contained: Lemma 1 derives the incremental gain via the matrix determinant lemma; Lemma 2 proves monotonicity and diminishing returns through the Woodbury identity and Lowner ordering; Lemma 3 proves the spacing-only independence system is a 2-system with an explicit neighborhood argument. The 1/3 bound then follows from the external k-system greedy theorem of Feldman et al. [32], not from any fitted value or from a self-citation. No parameter is fitted to simulations and then renamed a prediction: the 90% MI figure is an empirical observation used only as validation, and the 34.4x runtime comparison is a measurement. The robust-CSI extension explicitly guarantees 1/3 only for the Jensen surrogate objective c_r(S), and the surrogate has the same per-position additive codebook structure as the perfect-CSI objective, so the Sec. IV submodularity argument carries over; the MC-greedy comparison is again empirical validation rather than an input to the proof. Self-citations are minor: [1] is the conference version and appears only in the provenance footnote, while [14], [28], and [38] are standard or non-overlapping references not used to supply the approximation guarantee. One non-circular rigor gap deserves note: the paper never explicitly proves that the exact-cardinality capped family {S : |S| = N_BS, spacing satisfied} is a 2-system; Lemma 3 only covers the hereditary spacing-only system I. Because c(S) is monotone, the standard truncation argument (max over |S| <= N_BS equals max over |S| = N_BS, and greedy will not stop early) would close this gap, but the paper omits that reasoning. This is a missing proof step, not circularity: no equation or citation is reused as its own conclusion, and the missing step is supplied by a standard external argument rather than by the paper's own claims.

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

The central claim rests on the standard greedy theorem for k-systems, the codebook channel model with coupling-free positions, and the additive Gaussian error model in the robust extension. No free parameters are fitted to data; N_D is a system design parameter chosen from the physical half-wavelength spacing. The only invented entity is the interpretive 'virtual users' metaphor, which is not load-bearing.

assumptions (4)
  • standard math Greedy approximation theorem for monotone submodular maximization over a k-system, guaranteeing a (1+k)^-1 approximation.
    Invoked in Section IV-B to obtain the 1/3 bound; cited to [32] and not proved in this paper.
  • domain assumption Far-field field-response channel model with per-position steering vectors and no mutual coupling beyond the minimum-spacing constraint.
    Equations (5)-(8) define the channel H_k(v) as a deterministic function of the selected positions and fixed AoAs; this codebook structure is what makes w(v) independent of S and submodularity provable.
  • domain assumption Additive Gaussian channel estimation error with known covariance that factorizes as Ψ = E E^H.
    Section V-A, Eqs. (45)-(49); the Jensen surrogate and its submodularity rely on this error model and on Ψ_S being the principal submatrix for any S.
  • domain assumption Isotropic transmission covariance Q_k = (P/N_U) I.
    Section II-B, after P0; stated to focus on MA positioning; for general Q_k an alternating optimization is proposed but not analyzed.
invented entities (1)
  • Virtual users (phantom spatial streams)
    purpose: Interpret the Jensen surrogate c_r(S) as mutual information with N_BS additional interference streams caused by channel estimation error (Remark 6).
    This is a narrative re-reading of the matrix [E_S, H_S] in (51), not a new physical object. It makes no falsifiable prediction outside the paper, so it carries no independent evidence.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Efficient Discrete Position Design for Movable Antenna Systems: Low Complexity and Robustness." pith.science (2026). https://pith.science/paper/7LMDUBTT

@misc{pith2026260807413,
  author       = {Pith},
  title        = {Pith review of: Efficient Discrete Position Design for Movable Antenna Systems: Low Complexity and Robustness},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7LMDUBTT}},
  note         = {Machine review of arXiv:2608.07413}
}
read the original abstract

Building on advances in reconfigurable antenna techniques, movable antennas (MAs) can dynamically reshape antenna arrays and introduce additional spatial degrees of freedom (DoFs), thereby further improving communication performance. Despite these benefits, existing MA design algorithms often entail prohibitively high computational complexity from discrete positioning selection, which prevents practical implementations of MAs. In this paper, we investigate efficient solutions for the mutual information (MI) maximization problem of a multi-user multiple-input multiple-output (MU-MIMO) uplink communication system aided by discrete MAs. To this end, we first formulate the discrete MA positioning problem with the assumption of perfect channel state information (CSI). Then, we prove that the design problem falls into the category of monotone submodular maximization subject to a 2-system constraint. Accordingly, we propose a low-complexity distance-constrained submodular position search algorithm, which is theoretically shown to achieve at least 1/3 of the optimum. Furthermore, we extend our approach to scenarios with imperfect CSI, and show that the proposed submodular optimization-based design remains robust against channel estimation errors. Numerical results demonstrate that the proposed scheme can achieve at least 90% of the optimal solution's MI gain under both perfect and imperfect CSI assumptions. Remarkably, the algorithm achieves orders-of-magnitude complexity reduction (e.g., 34.4x faster than the branch-and-bound approach) while maintaining significant MI gains.

Figures

Figures reproduced from arXiv: 2608.07413 by the authors.

Figure 2
Figure 2. Discretely adjustable MA array with NBS antenna elements and NS possible positions. (FPAs) arranged with half-wavelength spacing on a uniform linear array (ULA), while the BS is equipped with NBS MAs1 constrained to move along a one-dimensional linear array2 . The antenna position vector for MAs is given by [14] r = [r1, r2, . . . , rNBS ] ∈ R 1×NBS , (1) where rm denotes the position of the m-th MA. In this paper, … view at source ↗
Figure 3
Figure 3. A unified view of diminishing incremental gains for concave and [PITH_FULL_IMAGE:figures/full_fig_p005_3.png] view at source ↗
Figure 4
Figure 4. (a) Runtime v.s. Nmc at a target normalized mean square error (NMSE) of −5 dB; (b) Expected MI of the MC-greedy and R-DCSPS v.s. NMSE with Nmc = 5000. Results in both subfigures are averaged over 30 paired channel realizations with NBS = 4, NS = 30, K = 2, NU = 2, L = 20, and SNR = 30 dB [PITH_FULL_IMAGE:figures/full_fig_p010_4.png] view at source ↗
Figures from the paper (8 more)
Figure 5
Figure 5. Figure 5: MI v.s. minimum-spacing constraint ND under perfect CSI, with A = 2(NBS − 1)λ, NBS = 4, NU = 2, K = 2, NS = 50, and SNR = 30 dB. The dashed vertical line marks the setting ⌈NSD/A⌉ = 5 of (56). to Nmax D = ⌊(NS − 1)/(NBS − 1)⌋ = 16 [PITH_FULL_IMAGE:figures/full_fig_p01…
Figure 6
Figure 6. Figure 6: MI convergence and incremental MI gain during the greedy selection [PITH_FULL_IMAGE:figures/full_fig_p012_6.png]
Figure 9
Figure 9. Figure 9: Required SNR v.s. target MI under the imperfect CSI when the NMSE [PITH_FULL_IMAGE:figures/full_fig_p012_9.png]
Figure 10
Figure 10. Figure 10: MI v.s. SNR under perfect CSI and non-isotropic transmissions with [PITH_FULL_IMAGE:figures/full_fig_p013_10.png]
Figure 12
Figure 12. Figure 12: MI v.s. aperture under perfect CSI when NBS = 4, NU = 2, SNR = 30 dB, and NS = 50. covariance design and confirm the superiority of the proposed DCSPS when practical directional transmit covariance is in￾corporated. On the other hand, in [PITH_FULL_IMAGE:figures/full…
Figure 13
Figure 13. Figure 13: MI v.s. NS under perfect CSI when NBS = 4, NU = 2, SNR = 30 dB, and A = 2(NBS − 1)λ. and enhances channel reconfiguration. The proposed scheme achieves approximately 90% of the BnB’s MI at saturation. However, the growth rate of both schemes gradually declines, ultima…
Figure 15
Figure 15. Figure 15: depicts the MI degradation v.s. NMSE. Bounded by the perfect-CSI BnB (upper) and fixed antenna (lower) benchmarks, the system MI declines as NMSE rises due to the increased resource cost of robustness. Despite this, the pro￾posed scheme achieves significantly higher M…
Figure 17
Figure 17. Figure 17: shows that the runtime stays almost flat and remains more than three orders of magnitude below the BnB and brute-force schemes, because K does not change the problem dimension, i.e., the number of outer iterations, as the selection still places NBS antennas over NS gr…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

40 extracted references · 32 canonical work pages

  1. [1]

    Exploiting submodularity for efficient discrete movable antenna placement,

    H. Wang, X. Yu, R. Wang, A. Li, and Y .-J. A. Zhang, “Exploiting submodularity for efficient discrete movable antenna placement,” in Proc. IEEE Int. Conf. Commun. (ICC), Glasgow, UK, May 2026, pp. 1–6

    work page 2026

  2. [2]

    An overview of massive MIMO: Benefits and challenges,

    L. Lu, G. Y . Li, A. L. Swindlehurst, A. Ashikhmin, and R. Zhang, “An overview of massive MIMO: Benefits and challenges,”IEEE J. Sel. Topics Signal Process., vol. 8, no. 5, pp. 742–758, Apr. 2014

    2014

  3. [3]

    An overview of signal processing techniques for millimeter wave MIMO systems,

    R. W. Heath, N. Gonz ´alez-Prelcic, S. Rangan, W. Roh, and A. M. Sayeed, “An overview of signal processing techniques for millimeter wave MIMO systems,”IEEE J. Sel. Topics Signal Process., vol. 10, no. 3, pp. 436–453, Feb. 2016

    work page 2016

  4. [4]

    Sensing- enhanced channel estimation for near-field XL-MIMO systems,

    S. Liu, X. Yu, Z. Gao, J. Xu, D. W. K. Ng, and S. Cui, “Sensing- enhanced channel estimation for near-field XL-MIMO systems,”IEEE J. Sel. Areas Commun., vol. 43, no. 3, pp. 628–643, 2025. 16

    work page 2025

  5. [5]

    Electromagnetically reconfigurable fluid antenna system for wireless communications: Design, modeling, algorithm, fabrication, and experiment,

    R. Wang, P. Zheng, V . V . Kotte, S. Rauf, Y . Yang, M. M. U. Rahman, T. Y . Al-Naffouri, and A. Shamim, “Electromagnetically reconfigurable fluid antenna system for wireless communications: Design, modeling, algorithm, fabrication, and experiment,”IEEE J. Sel. Areas Commun., vol. 44, pp. 1464–1479, 2026

    work page 2026

  6. [6]

    A tutorial on movable antennas for wireless networks,

    L. Zhu, W. Ma, W. Mei, Y . Zeng, Q. Wu, B. Ning, Z. Xiao, X. Shao, J. Zhang, and R. Zhang, “A tutorial on movable antennas for wireless networks,”IEEE Commun. Surveys Tuts., pp. 1–1, 2025

    work page 2025

  7. [7]

    Toward liquid reconfigurable antenna arrays for wireless communications,

    J. O. Mart ´ınez, J. R. Rodr ´ıguez, Y . Shen, K.-F. Tong, K.-K. Wong, and A. G. Armada, “Toward liquid reconfigurable antenna arrays for wireless communications,”IEEE Commun. Mag., vol. 60, no. 12, pp. 145–151, Dec. 2022

    work page 2022

  8. [8]

    Design and experimental validation of mmWave surface- wave-enabled fluid antennas for future wireless communications,

    Y . Shen, B. Tang, S. Gao, K.-F. Tong, H. Wong, K.-K. Wong, and Y . Zhang, “Design and experimental validation of mmWave surface- wave-enabled fluid antennas for future wireless communications,”IEEE Antennas Wireless Propag. Lett., vol. 25, no. 4, pp. 1467–1471, Apr. 2026

    work page 2026

Show all 40 references
  1. [9]

    Multichannel highly secure wireless communication system with information camouflage capability,

    H. L. Wang, H. F. Ma, Y . K. Zhang, T. Y . Zhang, S. Sun, Y . T. Chen, and T. J. Cui, “Multichannel highly secure wireless communication system with information camouflage capability,”Sci. Adv., vol. 10, no. 21, p. eadk7557, May 2024

    2024

  2. [10]

    Manipulations of multi-frequency waves and signals via multi-partition asynchronous space-time-coding digital metasurface,

    S. R. Wang, J. Y . Dai, Q. Y . Zhou, J. C. Ke, Q. Cheng, and T. J. Cui, “Manipulations of multi-frequency waves and signals via multi-partition asynchronous space-time-coding digital metasurface,”Nat. Commun., vol. 14, no. 1, p. 5377, Sep. 2023

    2023

  3. [11]

    Re- configurable antennas: Design and applications,

    J. Costantine, Y . Tawk, S. E. Barbin, and C. G. Christodoulou, “Re- configurable antennas: Design and applications,”Proc. IEEE, vol. 103, no. 3, pp. 424–437, Apr. 2015

    2015

  4. [12]

    Be water, my antennas: Riding on radio wave fluctuation in nature for spatial multiplexing using programmable meta-fluid antenna,

    B. Liu, K.-F. Tong, K.-K. Wong, C.-B. Chae, and H. Wong, “Be water, my antennas: Riding on radio wave fluctuation in nature for spatial multiplexing using programmable meta-fluid antenna,”arXiv preprint arXiv:2502.04693, 2025

    2025 arXiv

  5. [13]

    6DMA enhanced wireless network with flexible antenna position and rotation: Opportunities and challenges,

    X. Shao and R. Zhang, “6DMA enhanced wireless network with flexible antenna position and rotation: Opportunities and challenges,”IEEE Commun. Mag., vol. 63, no. 4, pp. 121–128, Apr. 2025

    2025

  6. [14]

    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

  7. [15]

    Near-field communication with massive movable antennas: A functional perspective,

    S. Liu, X. Yu, J. Xu, and R. Zhang, “Near-field communication with massive movable antennas: A functional perspective,”IEEE Trans. Wireless Commun., vol. 25, pp. 14 455–14 470, 2026

    2026

  8. [16]

    Fluid antenna-assisted ISAC systems,

    L. Zhou, J. Yao, M. Jin, T. Wu, and K.-K. Wong, “Fluid antenna-assisted ISAC systems,”IEEE Wireless Commun. Lett., vol. 13, no. 12, pp. 3533– 3537, Oct. 2024

    2024

  9. [17]

    Movable- antenna-enhanced wireless-powered mobile-edge computing systems,

    P. Chen, Y . Yang, B. Lyu, Z. Yang, and A. Jamalipour, “Movable- antenna-enhanced wireless-powered mobile-edge computing systems,” IEEE Internet Things J., vol. 11, no. 21, pp. 35 505–35 518, Aug. 2024

    2024

  10. [18]

    Learning-based joint beam- forming and antenna movement design for movable antenna systems,

    C. Weng, Y . Chen, L. Zhu, and Y . Wang, “Learning-based joint beam- forming and antenna movement design for movable antenna systems,” IEEE Wireless Commun. Lett., vol. 13, no. 8, pp. 2120–2124, May 2024

    2024

  11. [19]

    Dynamic beam coverage for satellite communications aided by movable-antenna array,

    L. Zhu, X. Pi, W. Ma, Z. Xiao, and R. Zhang, “Dynamic beam coverage for satellite communications aided by movable-antenna array,”IEEE Trans. Wireless Commun., vol. 24, no. 3, pp. 1916–1933, Dec. 2025

    1916

  12. [20]

    Fluid antenna array enhanced over-the-air computation,

    D. Zhang, S. Ye, M. Xiao, K. Wang, M. Di Renzo, and M. Skoglund, “Fluid antenna array enhanced over-the-air computation,”IEEE Wireless Commun. Lett., vol. 13, no. 6, pp. 1541–1545, Mar. 2024

    2024

  13. [21]

    A tutorial on fluid antenna system for 6G networks: Encompassing communication theory, optimization methods and hardware designs,

    W. K. New, K.-K. Wong, H. Xu, C. Wang, F. R. Ghadi, J. Zhang, J. Rao, R. Murch, P. Ram ´ırez-Espinosa, D. Morales-Jimenez, C.-B. Chae, and K.-F. Tong, “A tutorial on fluid antenna system for 6G networks: Encompassing communication theory, optimization methods and hardware desi...

    2024

  14. [22]

    Movable antenna-enhanced multiuser communication: Jointly optimal discrete antenna positioning and beamforming,

    Y . Wu, D. Xu, D. W. K. Ng, W. Gerstacker, and R. Schober, “Movable antenna-enhanced multiuser communication: Jointly optimal discrete antenna positioning and beamforming,” inProc. IEEE Global Commun. Conf. (GLOBECOM), Kuala Lumpur, Malaysia, Dec. 2023, pp. 7508– 7513

    2023

  15. [23]

    Movable-antenna po- sition optimization: A graph-based approach,

    W. Mei, X. Wei, B. Ning, Z. Chen, and R. Zhang, “Movable-antenna po- sition optimization: A graph-based approach,”IEEE Wireless Commun. Lett., vol. 13, no. 7, pp. 1853–1857, Apr. 2024

    2024

  16. [24]

    Movable-antenna position optimization for physical-layer security via discrete sampling,

    W. Mei, X. Wei, Y . Liu, B. Ning, and Z. Chen, “Movable-antenna position optimization for physical-layer security via discrete sampling,” inProc. IEEE Global Commun. Conf. (GLOBECOM), Cape Town, South Africa, Dec. 2024, pp. 4750–4755

    2024

  17. [25]

    Movable antennas meet intelligent reflecting surface: When do we need movable antennas?

    X. Wei, W. Mei, Q. Wu, B. Ning, and Z. Chen, “Movable antennas meet intelligent reflecting surface: When do we need movable antennas?” in Proc. IEEE Wireless Commun. Netw. Conf. (WCNC), Milan, Italy, Mar. 2025, pp. 1–6

    2025

  18. [26]

    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, 2024

    2024

  19. [27]

    Tse and P

    D. Tse and P. Viswanath,Fundamentals of wireless communication. Cambridge university press, 2005

    2005

  20. [28]

    A simple and effective approach for transmit antenna selection in multiuser massive MIMO leveraging submodularity,

    A. Konar and N. D. Sidiropoulos, “A simple and effective approach for transmit antenna selection in multiuser massive MIMO leveraging submodularity,”IEEE Trans. Signal Process., vol. 66, no. 18, pp. 4869– 4883, Aug. 2018

    2018

  21. [29]

    Multicell MIMO communications relying on intelligent reflecting surfaces,

    C. Pan, H. Ren, K. Wang, W. Xu, M. Elkashlan, A. Nallanathan, and L. Hanzo, “Multicell MIMO communications relying on intelligent reflecting surfaces,”IEEE Trans. Wireless Commun., vol. 19, no. 8, pp. 5218–5233, Aug. 2020

    2020

  22. [30]

    A stabilization algorithm for a class of uncertain linear systems,

    I. R. Petersen, “A stabilization algorithm for a class of uncertain linear systems,”Syst. Control Lett., vol. 8, no. 4, pp. 351–357, 1987

    1987

  23. [31]

    Multiplicative submodularity of a matrix’s principal minor as a function of the set of its rows and some combinatorial applications,

    A. K. Kelmans and B. N. Kimelfeld, “Multiplicative submodularity of a matrix’s principal minor as a function of the set of its rows and some combinatorial applications,”Discret. Math., vol. 44, no. 1, pp. 113–116, 1983

    1983

  24. [32]

    Improved approxi- mations for k-exchange systems,

    M. Feldman, J. Naor, R. Schwartz, and J. Ward, “Improved approxi- mations for k-exchange systems,” inProc. European Symp. Algorithms (ESA), Saarbr ¨ucken, Germany, Sep. 2011, pp. 784–798

    2011

  25. [33]

    Polymatroidal dependence structure of a set of random variables,

    S. Fujishige, “Polymatroidal dependence structure of a set of random variables,”Inf. Control., vol. 39, no. 1, pp. 55–72, Oct. 1978

    1978

  26. [34]

    Optimal approximation for submodular and supermodular optimization with bounded curvature,

    M. Sviridenko, J. V ondr ´ak, and J. Ward, “Optimal approximation for submodular and supermodular optimization with bounded curvature,” Math. Oper. Res., vol. 42, no. 4, pp. 1197–1218, May 2017

    2017

  27. [35]

    A framework of robust transmission design for IRS-aided MISO communications with imperfect cascaded channels,

    G. Zhou, C. Pan, H. Ren, K. Wang, and A. Nallanathan, “A framework of robust transmission design for IRS-aided MISO communications with imperfect cascaded channels,”IEEE Trans. Signal Process., vol. 68, pp. 5092–5106, Aug. 2020

    2020

  28. [36]

    Ergodic achievable rate maximization of RIS-assisted millimeter-wave MIMO-OFDM communication systems,

    R. Li, S. Sun, and M. Tao, “Ergodic achievable rate maximization of RIS-assisted millimeter-wave MIMO-OFDM communication systems,” IEEE Trans. Wireless Commun., vol. 22, no. 3, pp. 2171–2184, Mar. 2023

    2023

  29. [37]

    Exploiting movable antennas in multicast communications,

    Z. Cheng, N. Li, J. Zhu, S. Yang, C. Ouyang, and X. Zhang, “Exploiting movable antennas in multicast communications,” inProc. IEEE Global Commun. Conf. (GLOBECOM), Taipei, Taiwan, Dec. 2025, pp. 2366– 2371

    2025

  30. [38]

    FAS enabled UA V for energy- efficient WPCNs,

    N. Abuzgaia, A. Salem, and A. Elbarsha, “FAS enabled UA V for energy- efficient WPCNs,”IEEE Commun. Lett., vol. 30, pp. 278–281, 2026

    2026

  31. [39]

    Iterative water-filling for Gaussian vector multiple-access channels,

    W. Yu, W. Rhee, S. Boyd, and J. M. Cioffi, “Iterative water-filling for Gaussian vector multiple-access channels,”IEEE Trans. Inf. Theory, vol. 50, no. 1, pp. 145–152, Jan. 2004

    2004

  32. [40]

    Y ALMIP : a toolbox for modeling and optimization in MATLAB,

    J. Lofberg, “Y ALMIP : a toolbox for modeling and optimization in MATLAB,” inProc. IEEE Int. Symp. Comput.-Aided Control Syst. Design (CACSD), Taipei, Taiwan, Sep. 2004, pp. 284–289

    2004

Pith tools

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