Pith. sign in

REVIEW 3 major objections 5 minor 41 references

Near-Field Multiuser Localization Based on Extremely Large Antenna Array with Limited RF Chains

T0 review · 3 major / 5 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read Array partitioning lets a base station with far fewer RF chains than antennas localize multiple near-field users almost as well as the Bayesian Cramér-Rao bound permits.

desk verdict Solid algorithm work, but the BCRB in Eq. (60) uses variance where precision belongs, so the 'approaches BCRB' claim is not established. read the letter →

arxiv 2506.00884 v1 pith:4FKQAMUA submitted 2025-06-01 eess.SP

Boyu Teng , Xiaojun Yuan , Rui Wang , Ying-Chang Liang This is my paper
classification eess.SP MSC 94A1262F15
keywords near-fieldlocalizationextremelylargeantennaarraylimitedRFchainspartitioningmessagepassingBayesianCramér-RaoboundmultiuserMIMO6Gpositioning
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 investigates uplink positioning in a 6G-style system where the base station has an extremely large antenna array but only a small number of RF chains, because each RF chain is costly. Its central claim is that splitting the array into subarrays and treating the geometric relations between subarrays as probabilistic constraints makes the near-field multiuser localization problem tractable. The proposed APLE-LM algorithm, built on message passing, is claimed to locate several users accurately with a coarse initialization grid and to approach the derived Bayesian Cramér-Rao bound at high signal-to-noise ratio. If true, this means practical base stations with much smaller radio-frequency hardware could still deliver high-precision near-field positioning, supporting sensing and communication in the same 6G infrastructure.

What carries the argument

The load-bearing object is the array-partitioning signal model $y = B\rho + n$: the ELAA is divided into $M\times M$ subarrays, each with a reference antenna; $\rho$ stacks the reference-antenna gains of all users, $B$ stacks the subarray response vectors, which depend on user positions, and the analog beamforming matrix is absorbed into the observation. Two geometric constraints are modeled probabilistically: the observation constraint tying $y$ to positions and gains, and the constraint tying each user's reference gains across subarrays to that user's position. The algorithm applies the vector sum-product rule on the resulting factor graph, approximating position-to-observation and position-to-geometry messages by Gaussians and replacing them by Dirac deltas at their means in the integrals, then uses gradient ascent with Armijo step sizes for the nonlinear maximization. The Bayesian Cramér-Rao bound is obtained from the Fisher information matrix of the joint likelihood plus priors.

What would settle it

A Monte Carlo test at low SNR with a user near the edge of the array and a non-informative prior, comparing APLE-LM's RMSE against a dense-grid MAP estimate and the BCRB, would settle the claim: if APLE-LM's error stays far above the BCRB while the dense grid finds the true peak, the Gaussian and Dirac message approximations are the limiting factor.

Watch

Extended reading notes

Core claim

In a multiuser uplink MIMO system with an ELAA and analog beamforming, the received signal is rewritten so that each subarray contributes a position-dependent response matrix and a reference-antenna gain. The paper argues that estimating positions from this partitioned representation, rather than from the raw likelihood, avoids the worst of the non-convexity: the message-passing objective has a broader main peak and fewer grid points are needed for initialization. The APLE-LM algorithm iterates between two factor nodes, one encoding the observation and one encoding the geometric coupling of subarray reference antennas, and outputs both user positions and channel reconstructions. Simulations over array sizes, subarray partitions, RF-chain counts, distances, and SNRs show the estimator beating the exhaustive-search and polar-dictionary baselines and approaching the BCRB at high SNR, with the gap to the bound widening only when RF-chain counts are very low.

Load-bearing premise

The method's accuracy rests on treating each user's position uncertainty as a single-peaked bell curve during message passing; when the posterior is wide or has several separate peaks, for example at low SNR or with users placed at ambiguous angles, the algorithm replaces that distribution by one representative point, and the paper supplies no condition guaranteeing this shortcut stays unbiased.

Editorial extensions

If this is right

  • A base station with about 160 RF chains serving a $45\times45$ antenna array can locate three near-field users with accuracy approaching the BCRB at high SNR.
  • The number of initialization grid points required by APLE-LM stays nearly constant as the array grows from 45 to 75 antennas per side, while the baselines need more grid points, so the method scales better with array size.
  • Accurate channel reconstruction follows from the same position estimates, so the scheme can double as a channel estimator for the ELAA uplink.
  • The method tolerates different subarray partitioning geometries, such as $3\times25$ versus $5\times15$, with similar accuracy except at low SNR or very few RF chains, giving system designers freedom in choosing partitions.

Reading between the lines

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

  • An extension the paper leaves implicit is temporal tracking: because the algorithm's first message iteration already gives near-final accuracy, a recursive version could use the previous frame's estimate as initialization, removing the grid search almost entirely.
  • The aliasing caused by subarray reference antennas spaced beyond $\lambda/2$ suggests subarray size can be tuned to trade ambiguity against angular resolution; the paper does not optimize this trade-off.
  • The comparison with APLE-LM-ACM implies that for localization alone a simplified channel model may suffice, while radiation-pattern and path-loss details matter mainly for channel reconstruction; a deployment-focused study could quantify when the simplified model is good enough.
  • Under block fading, concatenating measurements across time slots is mentioned as a way to reduce RF-chain count further; a direct characterization of the minimal RF chains for a given number of slots would follow from the same model.
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

3 major / 5 minor

Summary. The paper studies near-field multiuser localization in an uplink ELAA MIMO system where the base station uses analog beamforming and a small number of RF chains. It introduces a near-field channel model that includes the antenna radiation pattern and free-space path loss, partitions the array into subarrays, and builds a probabilistic model linking user positions to subarray responses. The main algorithmic contribution is APLE-LM, a message-passing estimator that alternates between position and channel-gain updates on a loopy factor graph. The paper also derives a Bayesian Cramér-Rao bound (BCRB) for the problem and reports simulations comparing APLE-LM with ES-GA and P-SIGW baselines, concluding that APLE-LM approaches the BCRB at high SNR.

Significance. If the BCRB and the performance claims were correct, the paper would make a useful practical point: a base station with far fewer RF chains than antennas could still perform high-accuracy near-field positioning of multiple users. The system modeling is a genuine strength: the channel model in (5)-(7) goes beyond the common approximation in (8), the message derivations in Appendices A and B are detailed, and the simulation campaign against external baselines is extensive. It is also a positive feature that the proposed algorithm has several free parameters (subarray size, grid sizes, thresholds, damping) but none are fitted to the localization output, so the comparison with ES-GA and P-SIGW is not circular. The main weakness is the BCRB derivation, which as written uses prior variances where prior precisions are required; this directly affects the headline claim of approaching the BCRB.

major comments (3)
  1. [Section V, Eq. (60)] The a-priori information matrix J_P in Eq. (60) is incorrect. For the prior p(p_k)=N(p_k; μ, ν_pri_k I_3), the Fisher information contributed by the prior is ν_pri_k^{-1} I_3, not ν_pri_k I_3; for p(ϱ_k)=CN(ϱ_k;0,τ_pri_k), it is (2/τ_pri_k) I_2, not (τ_pri_k/2) I_2. With the non-informative settings τ_pri=ν_pri=10^9 used in Section VI-A, Eq. (60) injects prior precisions of order 10^9 into J, so J is dominated by J_P and the BCRB in (61) is artificially small. The claim that APLE-LM approaches the BCRB at high SNR (abstract and Section VI-B2) is therefore not supported by Figs. 5 and 6; the bound must be re-derived with the correct prior precision and the simulations re-run.
  2. [Section V, Eqs. (56)-(59)] The derivation of J_F is not self-contained. Eq. (57) writes the log-likelihood as ln(p(y|p,ρ)p(ρ|p,ϱ)), but p(ρ|p,ϱ) is a Dirac delta (Eq. (21b)) and its logarithm is not defined. The final formula (59) is the Fisher information of the linear Gaussian model y=Bρ+n with ρ treated as an independent variable; the Jacobian of the transformation ρ_k=ϱ_k c(p_k) is not displayed. Please state the marginalized likelihood p(y|p,ϱ)=CN(y; Σ_k ϱ_k B_k(p_k)c_k(p_k), C_n) and show that ∂(Bρ)/∂η in (59) is the total derivative with respect to η=[p^T,Re ϱ,Im ϱ]^T.
  3. [Section IV, Eqs. (37) and (46)] The message-passing derivation replaces Δ_{p→ξ}(p) and Δ_{p→ψ}(p) by Dirac deltas at their means and approximates all position messages as Gaussian (Eqs. (27), (43)). These approximations are load-bearing for the claim that APLE-LM is near-optimal: no validity condition or error bound is provided, and Section VI-B4 shows that the algorithm is sensitive to initialization and can be trapped in local optima (e.g., with N_RF<90 or low SNR). The authors should either state the regime in which the approximations are accurate or temper the near-optimality claim to an empirical one.
minor comments (5)
  1. [Section VI-B2] The subsection title 'Comparation with baseline schemes' should be 'Comparison with baseline schemes'.
  2. [Fig. 10 caption] The caption describes 'varying the distance range of UEs,' but the text describes a single-user polar-coordinate study; the caption should match the experiment actually shown.
  3. [Eq. (63a)] The quantity in (63a) is an average over users but is named RMSE(p_k); please clarify whether the reported metric is per-user or joint and adjust the notation accordingly.
  4. [Fig. 4] The text refers to '45 array antennas' and '75 array antennas' but does not clearly identify which curves in the figure correspond to which array size; please add this information to the caption or legend.
  5. [Section VI-A] After correcting Eq. (60), the BCRB will depend on the prior variances only through J_F; the simulation section should state explicitly how the prior parameters are varied or kept fixed in the reported curves.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: APLE-LM and the BCRB are derived from the stated model and priors, and validation against ES-GA and P-SIGW is external.

full rationale

The paper's derivation chain is self-contained. The received-signal model (17), priors (20), and joint pdf (23) are stated assumptions, not restatements of the final localization result. The APLE-LM messages in Section IV are obtained by applying the standard sum-product rule with Gaussian and Dirac-delta approximations (Eqs. (37), (46)), and no parameter is fitted to the true user positions or to the BCRB. The BCRB in Section V is a conventional Fisher-information computation from the same model and priors; benchmarking an estimator against a bound derived from the same model is standard practice and does not make the comparison circular. The baseline algorithms ES-GA and P-SIGW are independent external implementations, and the complexity and accuracy comparisons with them are not manufactured by the derivation. The self-citations to the authors' prior APLE and APLE-ABL works and to their vector message-passing framework are motivational or technical tools, but the correctness of the proposed algorithm does not reduce to those citations; the algorithm's updates are derived in this paper and tested against the external baselines. The possible error in Eq. (60) regarding how the prior variances enter the prior information matrix is a correctness concern about the BCRB, not a circularity in the derivation chain.

Assumptions & free parameters 6 free parameters · 6 assumptions · 0 invented entities

The paper introduces no new physical entities. The analysis relies on a standard near-field LoS channel model, a chosen antenna pattern, and several unproved approximations in the message-passing derivation. The listed free parameters are user-set algorithmic constants or modeling simplifications, not parameters fitted to the localization output.

free parameters (6)
  • Subarray partition size M = 3, 4, 5 (tested)
    The array is divided into MxM subarrays; M controls model granularity and algorithm performance, chosen by hand in simulations.
  • Initialization grid sizes Mx, My, Mr = Mx=My=4*NS,x, Mr=2 (default)
    Grid density for the initial exhaustive search in Section IV-D; selected as a trade-off between complexity and avoidance of local optima.
  • Prior variances tau_pri, nu_pri = 1e9
    Set to large values to approximate non-informative priors in Eq. (20); they directly enter the BCRB and message updates.
  • Stopping threshold epsilon = unspecified
    Convergence threshold in Algorithm 1 and Algorithm 2; chosen by hand but its value is not reported.
  • Damping factor = unspecified
    Applied to messages to stabilize loopy message passing in Section IV-E; the value is not given.
  • Channel gain constant alpha_k = lambda^2/(16 pi^2)
    Set in Section II-B for simplicity; dimensionally inconsistent with the Friis amplitude lambda/(4pi d) and affects SNR scaling in simulations.
assumptions (6)
  • domain assumption The received channel is a single-path line-of-sight near-field spherical wavefront with no multipath or blockage.
    Invoked in Section II-B; the entire signal model, algorithm, and simulations assume this.
  • domain assumption The antenna power radiation pattern is F(theta,phi)=cos^3(theta) for theta in [0,pi/2], zero otherwise.
    Adopted from Refs. [33], [34] in Eq. (3); the gamma term in Eq. (6) depends on it.
  • domain assumption The analog beamforming matrix W has unit-modulus entries with random phases, a fully connected architecture, and ideal phase shifters.
    Section II-C and the simulation settings; hardware impairments and phase quantization are ignored.
  • ad hoc to paper Messages from p to xi and p to psi are replaced by Dirac deltas at their means.
    Used in Eqs. (37) and (46) to make integrals tractable; no error bound or validity condition is provided.
  • ad hoc to paper All messages on the factor graph can be accurately approximated as Gaussian.
    The true messages are non-Gaussian, and the Gaussian approximation is not analytically justified anywhere in Section IV.
  • ad hoc to paper The objective in Eq. (26) has a sufficiently broad main peak that gradient ascent with coarse grid initialization finds the global maximum.
    Motivated by a single illustrative example in Fig. 3, not proven; the algorithm's success depends on this property.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Near-Field Multiuser Localization Based on Extremely Large Antenna Array with Limited RF Chains." pith.science (2026). https://pith.science/paper/4FKQAMUA

@misc{pith2026250600884,
  author       = {Pith},
  title        = {Pith review of: Near-Field Multiuser Localization Based on Extremely Large Antenna Array with Limited RF Chains},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4FKQAMUA}},
  note         = {Machine review of arXiv:2506.00884}
}
read the original abstract

Extremely large antenna array (ELAA) not only effectively enhances system communication performance but also improves the sensing capabilities of communication systems, making it one of the key enabling technologies in 6G wireless networks. This paper investigates the multiuser localization problem in an uplink Multiple Input Multiple Output (MIMO) system, where the base station (BS) is equipped with an ELAA to receive signals from multiple single-antenna users. We exploit analog beamforming to reduce the number of radio frequency (RF) chains. We first develop a comprehensive near-field ELAA channel model that accounts for the antenna radiation pattern and free space path loss. Due to the large aperture of the ELAA, the angular resolution of the array is high, which improves user localization accuracy. However, it also makes the user localization problem highly non-convex, posing significant challenges when the number of RF chains is limited. To address this issue, we use an array partitioning strategy to divide the ELAA channel into multiple subarray channels and utilize the geometric constraints between user locations and subarrays for probabilistic modeling. To fully exploit these geometric constraints, we propose the array partitioning-based location estimation with limited measurements (APLE-LM) algorithm based on the message passing principle to achieve multiuser localization. We derive the Bayesian Cramer-Rao Bound (BCRB) as the theoretical performance lower bound for our formulated near-field multiuser localization problem. Extensive simulations under various parameter configurations validate the proposed APLE-LM algorithm. The results demonstrate that APLE-LM achieves superior localization accuracy compared to baseline algorithms and approaches the BCRB at high signal-to-noise ratio (SNR).

Figures

Figures reproduced from arXiv: 2506.00884 by the authors.

Figure 1
Figure 1. System model. The BS receives the signals from [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. The factor graph representation corresponding to the joint pdf [PITH_FULL_IMAGE:figures/full_fig_p006_2.png] view at source ↗
Figure 3
Figure 3. Illustrations of distributions in (12), (26), and (42). We consider a single-user 2D positioning scenario where the user is located in [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (5 more)
Figure 5
Figure 5. Figure 5: The UE localization performance v.s. SNR. [PITH_FULL_IMAGE:figures/full_fig_p011_5.png]
Figure 6
Figure 6. Figure 6: The channel reconstruction performance v.s. SNR. [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]
Figure 9
Figure 9. Figure 9: The UE localization performance v.s. SNR with varying the [PITH_FULL_IMAGE:figures/full_fig_p012_9.png]
Figure 10
Figure 10. Figure 10: The UE localization performance v.s. SNR with varying the [PITH_FULL_IMAGE:figures/full_fig_p012_10.png]
Figure 11
Figure 11. Figure 11: The convergence behavior of the proposed APLE-LM [PITH_FULL_IMAGE:figures/full_fig_p013_11.png]

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

41 extracted references · 36 canonical work pages

  1. [1]

    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

  2. [2]

    6G wire- less communication systems: Applications, requirements, technologies, challenges, and research directions,

    M. Z. Chowdhury, M. Shahjalal, S. Ahmed, and Y . M. Jang, “6G wire- less communication systems: Applications, requirements, technologies, challenges, and research directions,”IEEE Open J. Commun. Soc., vol. 1, pp. 957–975, 2020

    work page 2020

  3. [3]

    Con- vergent communication, sensing and localization in 6G systems: An overview of technologies, opportunities and challenges,

    C. De Lima, D. Belot, R. Berkvens, A. Bourdoux, D. Dardari, M. Guil- laud, M. Isomursu, E.-S. Lohan, Y . Miao, A. N. Barretoet al., “Con- vergent communication, sensing and localization in 6G systems: An overview of technologies, opportunities and challenges,”IEEE Access, vol. 9, pp. 26 902–26 925, 2021

    work page 2021

  4. [4]

    Localization as a key enabler of 6G wireless systems: A comprehensive survey and an outlook,

    S. E. Trevlakis, A.-A. A. Boulogeorgos, D. Pliatsios, J. Querol, K. Nton- tin, P. Sarigiannidis, S. Chatzinotas, and M. Di Renzo, “Localization as a key enabler of 6G wireless systems: A comprehensive survey and an outlook,”IEEE Open J. Commun. Soc., 2023

    work page 2023

  5. [5]

    Integration of communication and sensing in 6G: A joint industrial and academic perspective,

    H. Wymeersch, D. Shrestha, C. M. de Lima, V . Yajnanarayana, B. Richerzhagen, M. F. Keskin, K. Schindhelm, A. Ramirez, A. Wolf- gang, M. F. de Guzmanet al., “Integration of communication and sensing in 6G: A joint industrial and academic perspective,” inIEEE PIMRC Workhops, Sep. 2021, pp. 1–7

    work page 2021

  6. [6]

    Integrated sensing and communications: Towards dual-functional wire- less networks for 6G and beyond,

    F. Liu, Y . Cui, C. Masouros, J. Xu, T. X. Han, Y . C. Eldar, and S. Buzzi, “Integrated sensing and communications: Towards dual-functional wire- less networks for 6G and beyond,”IEEE J. Sel. Areas Commun., Mar. 2022, early access

    work page 2022

  7. [7]

    A survey on fundamental limits of integrated sensing and communication,

    A. Liu, Z. Huang, M. Li, Y . Wan, W. Li, T. X. Han, C. Liu, R. Du, D. K. P. Tan, J. Luet al., “A survey on fundamental limits of integrated sensing and communication,”IEEE Commun. Surv. Tutorials, Feb. 2022, early access

    work page 2022

  8. [8]

    Bayesian user localization and tracking for reconfigurable intelligent surface aided MIMO systems,

    B. Teng, X. Yuan, R. Wang, and S. Jin, “Bayesian user localization and tracking for reconfigurable intelligent surface aided MIMO systems,” IEEE J. Sel. Top. Signal Process., vol. 16, no. 5, pp. 1040–1054, Aug. 2022

    work page 2022

Show all 41 references
  1. [9]

    Cooperative localization in wireless networks,

    H. Wymeersch, J. Lien, and M. Z. Win, “Cooperative localization in wireless networks,”Proceedings of the IEEE, vol. 97, no. 2, pp. 427– 450, 2009

    2009

  2. [10]

    Self UA V localiza- tion using multiple base stations based on tdoa measurements,

    S. Motie, H. Zayyani, M. Salman, and M. Bekrani, “Self UA V localiza- tion using multiple base stations based on tdoa measurements,”IEEE Wireless Commun. Lett., vol. 13, no. 9, pp. 2432–2436, Sep. 2024

    2024

  3. [11]

    A tutorial on extremely large-scale MIMO for 6G: Fundamentals, signal processing, and applications,

    Z. Wang, J. Zhang, H. Du, D. Niyato, S. Cui, B. Ai, M. Debbah, K. B. Letaief, and H. V . Poor, “A tutorial on extremely large-scale MIMO for 6G: Fundamentals, signal processing, and applications,”IEEE Commun. Surv. Tutorials, vol. 26, no. 3, pp. 1560–1605, 2024. 15 ∂2γ(i,j),k ...

    2024

  4. [12]

    Near-field MIMO communications for 6G: Fundamentals, challenges, potentials, and future directions,

    M. Cui, Z. Wu, Y . Lu, X. Wei, and L. Dai, “Near-field MIMO communications for 6G: Fundamentals, challenges, potentials, and future directions,”IEEE Commun. Mag., vol. 61, no. 1, pp. 40–46, Sep. 2022

    2022

  5. [13]

    Toward beamfocusing-aided near-field communications: Research advances, po- tential, and challenges,

    J. An, C. Yuen, L. Dai, M. Di Renzo, M. Debbah, and L. Hanzo, “Toward beamfocusing-aided near-field communications: Research advances, po- tential, and challenges,”arXiv preprint arXiv:2309.09242, 2023

    2023 arXiv

  6. [14]

    Extremely large-scale MIMO: Fundamentals, challenges, solutions, and future directions,

    Z. Wang, J. Zhang, H. Du, E. Wei, B. Ai, D. Niyato, and M. Debbah, “Extremely large-scale MIMO: Fundamentals, challenges, solutions, and future directions,”IEEE Wireless Commun., vol. 31, no. 3, pp. 117–124, Jun. 2023

    2023

  7. [15]

    Near-field sparse channel representation and estimation in 6G wireless communications,

    X. Zhang, H. Zhang, and Y . C. Eldar, “Near-field sparse channel representation and estimation in 6G wireless communications,”IEEE Trans. Commun., vol. 72, no. 1, pp. 450–464, Jan. 2023

    2023

  8. [16]

    Near-field channel estimation in mixed LoS/NLoS environments for extremely large-scale MIMO systems,

    Y . Lu and L. Dai, “Near-field channel estimation in mixed LoS/NLoS environments for extremely large-scale MIMO systems,”IEEE Trans. Commun., vol. 71, no. 6, pp. 3694–3707, Jun. 2023

    2023

  9. [17]

    Channel estimation for extremely large-scale MIMO: far-field or near-field?

    M. Cui and L. Dai, “Channel estimation for extremely large-scale MIMO: far-field or near-field?”IEEE Trans. Commun., vol. 70, no. 4, pp. 2663–2677, 2022

    2022

  10. [18]

    Joint beam training and positioning for intelligent reflecting surfaces assisted millimeter wave communications,

    W. Wang and W. Zhang, “Joint beam training and positioning for intelligent reflecting surfaces assisted millimeter wave communications,” IEEE Trans. Wireless Commun., vol. 20, no. 10, pp. 6282–6297, Apr. 2021

    2021

  11. [19]

    Scalable near- field localization based on partitioned large-scale antenna array,

    X. Yuan, M. Zhang, Y . Zheng, B. Teng, and W. Jiang, “Scalable near- field localization based on partitioned large-scale antenna array,”IEEE Trans. Wireless Commun., 2024, early access

    2024

  12. [20]

    Near-field localization with limited RF chains: An array partitioning approach,

    B. Teng, X. Yuan, and R. Wang, “Near-field localization with limited RF chains: An array partitioning approach,”IEEE Transactions on Vehicular Technology, 2024, early access

    2024

  13. [21]

    Localization of near-field sources: A reduced-dimension MUSIC algorithm,

    X. Zhang, W. Chen, W. Zheng, Z. Xia, and Y . Wang, “Localization of near-field sources: A reduced-dimension MUSIC algorithm,”IEEE Commun. Lett., vol. 22, no. 7, pp. 1422–1425, 2018

    2018

  14. [22]

    Near-field source localization via symmetric subarrays,

    W. Zhi and M. Y .-W. Chia, “Near-field source localization via symmetric subarrays,” in2007 IEEE International Conference on Acoustics, Speech and Signal Processing-ICASSP’07, vol. 2, 2007, pp. II–1121

    2007

  15. [23]

    RIS-aided near-field localization and channel estimation for the terahertz system,

    Y . Pan, C. Pan, S. Jin, and J. Wang, “RIS-aided near-field localization and channel estimation for the terahertz system,”IEEE J. Sel. Top. Signal Process., vol. 17, no. 4, pp. 878–892, 2023

    2023

  16. [24]

    Sensing user’s activity, channel, and location with near-field extra-large-scale mimo,

    L. Qiao, A. Liao, Z. Li, H. Wang, Z. Gao, X. Gao, Y . Su, P. Xiao, L. You, and D. W. K. Ng, “Sensing user’s activity, channel, and location with near-field extra-large-scale mimo,”IEEE Trans. Commun., vol. 72, no. 2, pp. 890–906, Feb. 2023

    2023

  17. [25]

    Near-field localization with a reconfigurable intelligent surface acting as lens,

    Z. Abu-Shaban, K. Keykhosravi, M. F. Keskin, G. C. Alexandropoulos, G. Seco-Granados, and H. Wymeersch, “Near-field localization with a reconfigurable intelligent surface acting as lens,” inICC 2021-IEEE International Conference on Communications, 2021, pp. 1–6

    2021

  18. [26]

    ELAA near-field localization and sensing with partial blockage detection,

    H. Chen, P. Zheng, Y . Ge, A. Elzanaty, J. He, T. Y . Al-Naffouri, and H. Wymeersch, “ELAA near-field localization and sensing with partial blockage detection,”arXiv preprint arXiv:2402.15857, 2024

    2024 arXiv

  19. [27]

    Near-field localization and channel reconstruction for ELAA systems,

    Z. Lu, Y . Han, S. Jin, and M. Matthaiou, “Near-field localization and channel reconstruction for ELAA systems,”IEEE Trans. Wireless Commun., vol. 23, no. 7, pp. 6938–6953, Jul. 2023

    2023

  20. [28]

    Massive MIMO with antenna selection: Fundamental limits and applications,

    S. Asaad, A. M. Rabiei, and R. R. M ¨uller, “Massive MIMO with antenna selection: Fundamental limits and applications,”IEEE Trans. Wireless Commun., vol. 17, no. 12, pp. 8502–8516, Dec. 2018

    2018

  21. [29]

    Massive MIMO antenna selection: Switching architectures, capacity bounds, and optimal antenna selection algorithms,

    Y . Gao, H. Vinck, and T. Kaiser, “Massive MIMO antenna selection: Switching architectures, capacity bounds, and optimal antenna selection algorithms,”IEEE Trans. Signal Process., vol. 66, no. 5, pp. 1346–1360, Mar. 2017

    2017

  22. [30]

    Detection of spatially modulated signals via RLS: Theoretical bounds and applica- tions,

    A. Bereyhi, S. Asaad, B. Gade, R. R. M ¨uller, and H. V . Poor, “Detection of spatially modulated signals via RLS: Theoretical bounds and applica- tions,”IEEE Transactions on Wireless Communications, vol. 21, no. 4, pp. 2291–2304, Apr. 2021

    2021

  23. [31]

    Hybrid beamforming for multi-user massive MIMO systems,

    X. Wu, D. Liu, and F. Yin, “Hybrid beamforming for multi-user massive MIMO systems,”IEEE Trans. Commun., vol. 66, no. 9, pp. 3879–3891, Sep. 2018

    2018

  24. [32]

    IRS-based integrated location sensing and communication for mmwave SIMO systems,

    X. Hu, C. Liu, M. Peng, and C. Zhong, “IRS-based integrated location sensing and communication for mmwave SIMO systems,”IEEE Trans. Wireless Commun., vol. 22, no. 6, pp. 4132–4145, Jun. 2022

    2022

  25. [33]

    Wireless communications with reconfigurable intelligent surface: Path loss modeling and experimental measurement,

    W. Tang, M. Z. Chen, X. Chen, J. Y . Dai, Y . Han, M. Di Renzo, Y . Zeng, S. Jin, Q. Cheng, and T. J. Cui, “Wireless communications with reconfigurable intelligent surface: Path loss modeling and experimental measurement,”IEEE Trans. Wireless Commun., vol. 20, no. 1, pp. 421– ...

    2020

  26. [34]

    W. L. Stutzman and G. A. Thiele,Antenna Theory and Design. John Wiley & Sons, 2012

    2012

  27. [35]

    J. L. V olakis and J. L. V olakis,Antenna engineering handbook. McGraw-Hill New York, 2007, vol. 1755

    2007

  28. [36]

    Unifying message passing algorithms under the framework of constrained bethe free energy minimization,

    D. Zhang, X. Song, W. Wang, G. Fettweis, and X. Gao, “Unifying message passing algorithms under the framework of constrained bethe free energy minimization,”IEEE Trans. Wireless Commun., vol. 20, no. 7, pp. 4144–4158, Jul. 2021

    2021

  29. [37]

    Hybrid vector message passing for generalized bilinear factorization,

    H. Jiang, X. Yuan, and Q. Guo, “Hybrid vector message passing for generalized bilinear factorization,”arXiv preprint arXiv:2401.03626, 2024

    2024 arXiv

  30. [38]

    Convex optimization,

    S. Boyd, “Convex optimization,”Cambridge UP, 2004

    2004

  31. [39]

    Bilinear generalized approxi- mate message passing—Part I: Derivation,

    J. T. Parker, P. Schniter, and V . Cevher, “Bilinear generalized approxi- mate message passing—Part I: Derivation,”IEEE Trans. Signal Process., vol. 62, no. 22, pp. 5839–5853, Sep. 2014

    2014

  32. [40]

    H. L. Van Trees,Detection, Estimation, and Modulation Theory, Part I: Detection, Estimation, and Linear Modulation Theory. John Wiley & Sons, 2004

    2004

  33. [41]

    Fraunhofer and Fresnel distances: Unified derivation for aperture antennas,

    K. T. Selvan and R. Janaswamy, “Fraunhofer and Fresnel distances: Unified derivation for aperture antennas,”IEEE Antennas Propag. Mag., vol. 59, no. 4, pp. 12–15, Aug. 2017

    2017

Pith tools

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