pith. sign in

arxiv: 2602.21973 · v2 · pith:7XD5JNRBnew · submitted 2026-02-25 · 📡 eess.SP

Sparse Array Design for Near-Field MU-MIMO: Reconfigurable Array Thinning Approach

Ahmed Hussain , Asmaa Abdallah , Abdulkadir Celik , Emil Bj\"ornson , Ahmed M. Eltawil This is my paper

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

classification 📡 eess.SP
keywords near-field MU-MIMOsparse array designreconfigurable array thinninggrating lobesparticle swarm optimizationsum-rate maximizationmovable antennas
0
0 comments X

The pith

Reconfigurable thinning of fixed arrays lets sparse near-field MIMO reach movable-antenna rates without mechanical movement.

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

The paper establishes that a fixed antenna array can be thinned on the fly by activating only a chosen subset of elements, forming sparse configurations that adapt to changing user locations in the near-field. This is done by first showing that grating lobes appear in the angle domain but not along the range dimension, then using particle-swarm optimization either to suppress those lobes or to directly maximize the multi-user sum rate. A sympathetic reader cares because large future arrays could thereby support spatial multiplexing in both angle and distance while avoiding the latency and hardware cost of physically repositioning antennas. The two resulting strategies, grating-lobe-based thinning and sum-rate-based thinning, are shown in simulation to outperform fixed uniform sparse arrays and to approach the performance of movable-antenna systems.

Core claim

A reconfigurable array thinning approach selectively activates a subset of antennas in a fixed array to realize flexible sparse designs for near-field multi-user MIMO. Grating-lobe analysis reveals their absence along the range dimension. Two particle-swarm-optimization strategies are introduced: grating-lobe-based thinned array (GTA) for lobe suppression and sum-rate-based thinned array (STA) for multi-user sum-rate maximization. Simulations confirm that GTA outperforms conventional uniform sparse arrays while STA achieves performance comparable to movable antennas.

What carries the argument

Reconfigurable array thinning driven by particle swarm optimization, which selects which fixed antennas to activate so as to either suppress grating lobes or maximize sum rate in near-field channels that include both angle and range effects.

If this is right

  • GTA improves grating-lobe control over uniform sparse arrays in both angle and range domains.
  • STA delivers multi-user rates close to those of movable antennas while using only fixed hardware.
  • The method supports dynamic user distributions through software reconfiguration rather than mechanical movement.
  • Sparse designs can exploit range-domain multiplexing without requiring a full dense array.

Where Pith is reading between the lines

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

  • The same thinning logic could be paired with low-complexity optimization routines to lower power draw by deactivating unused RF chains.
  • Extending the approach to joint optimization with beamforming weights might further improve range-domain user separation.
  • Prototype measurements with real near-field channels would test whether the reported gains survive hardware non-idealities.

Load-bearing premise

That particle swarm optimization can locate near-optimal activation patterns quickly enough for dynamic user distributions and that the near-field channel model captures real propagation without significant unmodeled hardware effects.

What would settle it

A simulation or measurement in which realistic hardware impairments or faster user mobility cause the thinned-array sum rates to fall below those of a movable-antenna baseline or to lose their advantage over uniform sparse arrays.

Figures

Figures reproduced from arXiv: 2602.21973 by Abdulkadir Celik, Ahmed Hussain, Ahmed M. Eltawil, Asmaa Abdallah, Emil Bj\"ornson.

Figure 1
Figure 1. Figure 1: Beam pattern in angle and range domain: grating lobes appear [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Sum-rate for SULA when UEs are distributed only along the range. sum-rate [bps/Hz] 0 50 100 150 200 250 C D F 0 0.2 0.4 0.6 0.8 1 FULA STA MULA GTA PTA SULA HULA [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
read the original abstract

Future wireless networks, deploying thousands of antenna elements, may operate in the radiative near-field (NF), enabling spatial multiplexing across both angle and range domains. Sparse arrays have the potential to achieve comparable performance with fewer antenna elements. However, fixed sparse array designs are generally suboptimal under dynamic user distributions, while movable antenna architectures rely on mechanically reconfigurable elements, introducing latency and increased hardware complexity. To address these limitations, we propose a reconfigurable array thinning approach that selectively activates a subset of antennas to form a flexible sparse array design without physical repositioning. We first analyze grating lobes for uniform sparse arrays in the angle and range domains, showing their absence along the range dimension. Based on the analysis, we develop two particle swarm optimization-based strategies: a grating-lobe-based thinned array (GTA) for grating-lobe suppression and a sum-rate-based thinned array (STA) for multiuser sum-rate maximization. Simulation results demonstrate that GTA outperforms conventional uniform sparse arrays, while STA achieves performance comparable to movable antennas, thereby offering a practical and efficient array deployment strategy without the associated mechanical complexity.

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 / 2 minor

Summary. The paper proposes a reconfigurable array thinning strategy for near-field MU-MIMO using particle swarm optimization (PSO). It introduces a grating-lobe-based thinned array (GTA) to suppress grating lobes in angle and range domains and a sum-rate-based thinned array (STA) to maximize multi-user sum rate. Simulations claim that GTA outperforms uniform sparse arrays while STA matches movable-antenna performance without mechanical overhead.

Significance. If the optimization results hold under realistic conditions, the approach could provide a lower-complexity alternative to movable antennas for exploiting near-field spatial multiplexing in large arrays, addressing dynamic user scenarios with fixed hardware.

major comments (2)
  1. The central practicality claim (that STA/GTA enable real-time adaptation for dynamic users) rests on unquantified PSO performance. No data are provided on iteration count, population size, convergence criteria, wall-clock time, or scaling with N (e.g., N=1000+), despite the 2^N search space; this directly undermines the assertion of an 'efficient array deployment strategy' relative to channel coherence time.
  2. Simulation results (as summarized in the abstract) report outperformance and comparability to movable antennas but supply no details on channel models, number of Monte Carlo trials, statistical significance testing, or PSO hyperparameter sensitivity; without these, it is unclear whether the gains are robust or scenario-specific.
minor comments (2)
  1. Clarify the exact near-field channel model (spherical-wave assumptions, range-angle coupling) and any hardware impairment modeling in the methods section.
  2. Add explicit comparison of computational complexity between GTA/STA and movable-antenna repositioning to strengthen the efficiency argument.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive and detailed review of our manuscript. The comments highlight important aspects for strengthening the presentation of our reconfigurable array thinning approach. We address each major comment below and have revised the manuscript to incorporate additional details and clarifications as appropriate.

read point-by-point responses

  1. Referee: The central practicality claim (that STA/GTA enable real-time adaptation for dynamic users) rests on unquantified PSO performance. No data are provided on iteration count, population size, convergence criteria, wall-clock time, or scaling with N (e.g., N=1000+), despite the 2^N search space; this directly undermines the assertion of an 'efficient array deployment strategy' relative to channel coherence time.

    Authors: We agree that quantitative details on PSO performance are necessary to support the practicality claims. In the revised manuscript, we have added a new subsection in the methodology that specifies the PSO parameters (population size of 50, maximum iterations of 200, convergence threshold of 1e-4), provides convergence curves for representative cases, and reports average wall-clock times measured on standard computing hardware for array sizes up to N=256. We also include an asymptotic complexity discussion (O(I * P * N) per optimization, where I is iterations and P is population) and compare these times to typical near-field channel coherence intervals at mmWave frequencies. While the combinatorial search space is large, the heuristic nature of PSO enables practical convergence in our tested scenarios; we have moderated the language around 'real-time' adaptation to reflect these empirical results rather than claiming universal efficiency. revision: yes

  2. Referee: Simulation results (as summarized in the abstract) report outperformance and comparability to movable antennas but supply no details on channel models, number of Monte Carlo trials, statistical significance testing, or PSO hyperparameter sensitivity; without these, it is unclear whether the gains are robust or scenario-specific.

    Authors: We appreciate this observation and acknowledge that the original simulation description was insufficiently detailed. The revised manuscript now explicitly states the near-field channel model (spherical-wave propagation with distance-dependent path loss and additive white Gaussian noise), reports that all sum-rate and grating-lobe results are averaged over 1000 independent Monte Carlo trials with standard deviation error bars, and includes a hyperparameter sensitivity study varying inertia weight and cognitive/social coefficients over a range of values. These additions demonstrate that the reported performance advantages of GTA and STA remain consistent, thereby addressing concerns about robustness and scenario specificity. revision: yes

Circularity Check

0 steps flagged

No circularity: optimization-based claims rest on independent simulations

full rationale

The manuscript first derives grating-lobe properties for uniform sparse arrays in the near-field angle and range domains from standard array factor expressions. It then applies conventional particle-swarm optimization to two separate objective functions (grating-lobe suppression for GTA, sum-rate maximization for STA) and reports numerical performance against uniform sparse arrays and movable-antenna baselines. No equation equates a reported performance gain to a quantity defined by the same fitted parameters; the PSO search is external to the final metric evaluation. No uniqueness theorem or ansatz is imported via self-citation to force the architecture. The derivation chain therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

1 free parameters · 1 axioms · 0 invented entities

The central claims rest on standard near-field propagation models and the effectiveness of PSO for combinatorial antenna selection; no new physical entities are introduced.

free parameters (1)
  • PSO hyperparameters
    Inertia weight, cognitive and social coefficients in particle swarm optimization are typically tuned to achieve convergence for the thinning problem.
axioms (1)
  • domain assumption Grating lobes are absent along the range dimension for uniform sparse arrays in the near-field
    Invoked in the initial analysis section to justify the thinning strategies.

pith-pipeline@v0.9.0 · 5737 in / 1279 out tokens · 38156 ms · 2026-05-22T11:18:39.692859+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

13 extracted references · 13 canonical work pages

  1. [1]

    Near-field ISAC: Synergy of dual-purpose codebooks and space-time adaptive processing,

    A. Hussain, A. Abdallah, A. Celik, and A. M. Eltawil, “Near-field ISAC: Synergy of dual-purpose codebooks and space-time adaptive processing,” IEEE Wireless Communs., vol. 32, no. 4, pp. 64–70, 2025

    work page 2025

  2. [2]

    Exploring frontiers of polar-domain codebooks for near-field channel estimation and beam training: A comprehensive analysis, case studies, and implications for 6G,

    A. Abdallah, A. Hussain, A. Celik, and A. M. Eltawil, “Exploring frontiers of polar-domain codebooks for near-field channel estimation and beam training: A comprehensive analysis, case studies, and implications for 6G,”IEEE Signal Process. Mag., vol. 42, no. 1, pp. 45–59, 2025

    work page 2025

  3. [3]

    Pre-optimized irregular arrays versus movable antennas in multi-user MIMO systems,

    A. Irshad, A. Kosasih, V . Petrov, and E. Bj ¨ornson, “Pre-optimized irregular arrays versus movable antennas in multi-user MIMO systems,” IEEE Wireless Commun. Lett., vol. 14, no. 8, pp. 2656–2660, 2025

    work page 2025

  4. [4]

    Sparse array enabled near-field communications: Beam pattern analysis and hybrid beamforming design,

    C. Zhou, C. You, H. Zhang, L. Chen, and S. Shi, “Sparse array enabled near-field communications: Beam pattern analysis and hybrid beamforming design,”arXiv preprint arXiv:2401.05690, 2024

    work page arXiv 2024

  5. [5]

    Near-field multiuser communications based on sparse arrays,

    K. Chen, C. Qi, G. Y . Li, and O. A. Dobre, “Near-field multiuser communications based on sparse arrays,”IEEE J. Sel. Topics Signal Process., vol. 18, no. 4, pp. 619–632, 2024

    work page 2024

  6. [6]

    Sparse-array-enabled wideband beamforming for near-field multiuser communications,

    Z. Wang, H. Xu, G. Zhang, X. Huang, and X. He, “Sparse-array-enabled wideband beamforming for near-field multiuser communications,”IEEE Internet Things J., vol. 12, no. 22, pp. 48 428–48 440, 2025

    work page 2025

  7. [7]

    From antenna abundance to antenna intelligence in 6G gigantic MIMO systems,

    E. Bj ¨ornson, A. Irshad, ¨O. T. Demir, G. T. F. de Abreu, A. Kosasih, and V . Petrov, “From antenna abundance to antenna intelligence in 6G gigantic MIMO systems,”arXiv preprint arXiv:2601.08326, 2026

    work page arXiv 2026

  8. [8]

    Movable antennas for wireless communication: Opportunities and challenges,

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

    work page 2024

  9. [9]

    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. Surv. Tutor ., 2025

    work page 2025

  10. [10]

    Thinned arrays using genetic algorithms,

    R. Haupt, “Thinned arrays using genetic algorithms,”IEEE Trans. Antennas Propag., vol. 42, no. 7, pp. 993–999, 1994

    work page 1994

  11. [11]

    Redefining polar boundaries for near-field channel estimation for ultra-massive MIMO antenna array,

    A. Hussain, A. Abdallah, and A. M. Eltawil, “Redefining polar boundaries for near-field channel estimation for ultra-massive MIMO antenna array,” IEEE Trans. Wireless Communs., vol. 24, no. 10, pp. 8193–8207, 2025

    work page 2025

  12. [12]

    Near-field beam-focusing pattern under discrete phase shifters,

    H. Zhang, C. You, and C. Zhou, “Near-field beam-focusing pattern under discrete phase shifters,”IEEE Trans. Wireless Commun., pp. 1–1, 2025

    work page 2025

  13. [13]

    R. C. Hansen,Phased array antennas. John Wiley & Sons, 2009

    work page 2009