Scattering Environment Aware Joint Multi-user Channel Estimation and Localization with Spatially Reused Pilots

An Liu; Kaiyuan Tian; Yani Chi; Yufan Zhou

REVIEW 4 major objections 5 minor 31 references

Scattering Environment Aware Joint Multi-user Channel Estimation and Localization with Spatially Reused Pilots

T0 review · 4 major / 5 minor · reviewed 2026-08-10 · deepseek-v4-flash

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

Pith's one-line read Spatially reused pilots can double pilot capacity in massive MIMO with little channel-estimation loss.

desk verdict A well-put-together two-timescale MU channel estimation/localization scheme with real pilot-reuse promise; the main open question is whether the sparsity priors (rho_k, lambda) are estimated or oracle-fed in simulation. read the letter →

arxiv 2501.02252 v1 pith:DLD3OHWU submitted 2025-01-04 eess.SP

Kaiyuan Tian , Yani Chi , Yufan Zhou , An Liu This is my paper · ORCID

classification eess.SP

keywords MIMO-OFDMmulti-userchannelestimationlocalizationpilotreusespatialdivisionmultiplexingscattererassociationlocation-domainsparsityturbo

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

Massive MIMO systems face a pilot bottleneck: every user needs a distinct pilot to avoid interference, so the number of users is capped by the pilot budget. This paper argues that the bottleneck can be loosened by treating the scattering environment as a shared resource: nearby users see the same scatterers, while distant users see nearly orthogonal channels. It proposes a two-timescale scheme that first maps each user's scatterers, merges shared scatterers across users, and groups users so that the same pilot can be reused for spatially separated channels. The short-timescale estimation then jointly recovers channels and locations under these reused pilots. Simulations indicate the multi-user non-orthogonal-pilot scheme supports more than twice the users per pilot resource as a single-user orthogonal-pilot baseline, with a modest loss in NMSE.

What carries the argument

The load-bearing object is the 3-D location-domain sparse representation of the multi-user channel, together with the joint sparsity prior that ties users together. Each user's NLOS channel is written as a sparse combination of basis vectors indexed by candidate scatterer locations, so users who see the same physical scatterer share non-zero entries in their support vectors; the overlap probability $\rho_k = L_k/L$ quantifies how much of the global scatterer set a given user sees. This representation turns the physical fact of common scattering into a signal-processing structure that the turbo algorithm can exploit, and it is what makes pilot reuse possible: users whose scatterer sets are far apart have nearly orthogonal columns and can safely share one pilot sequence. The two-timescale pipeline (TST-MUSIC for coarse angles and delays, DBSCAN for associating scatterer estimates across users, graph-coloring grouping, and SEA-LD-TurboCE for joint recovery) is the mechanism that converts this representation into a working estimator.

What would settle it

Run the proposed pipeline on measured or realistically simulated channels that contain dense diffuse scattering, multi-bounce paths, or non-point scatterers, and compare the multi-user non-orthogonal-pilot NMSE against the genie-aided LMMSE bound at high SNR; if the NMSE floor stays far above the bound even with orthogonal pilots, or if the gap between the non-orthogonal and orthogonal variants grows much larger than the simulated small loss, then the discrete-scatterer joint-sparsity model is the point of failure. A simpler check: compute the miss-detection probability of shared scatterers as SNR increases; if it does not fall with SNR, the physical premise of shared discrete scatterers is violated.

Watch

Extended reading notes

Core claim

The central claim is that channel estimation and localization in a massive MIMO-OFDM uplink can be performed jointly, accurately, and with far fewer pilot resources by exploiting the spatial structure shared among users. The paper models each user's channel in a 3-D location domain, where a channel is a line-of-sight component plus a few single-bounce paths through discrete scatterers, each described by its own position. Because nearby users are assumed to share scatterers, their support vectors in this domain overlap, and that overlap is parameterized by known probabilities. The proposed long-timescale phase uses TST-MUSIC to obtain coarse scatterer positions per user, DBSCAN to associate and refine shared scatterers, and a graph-coloring particle-swarm algorithm to group users whose channels are quasi-orthogonal in the location domain; users in the same group then reuse the same pilots. The short-timescale phase runs the SEA-LD-TurboCE algorithm, a turbo-style LMMSE/message-passing estimator with EM-based grid and position refinement, to estimate all channels and positions from the spatially reused pilots. Simulation results show the orthogonal-pilot variant approaching the genie-aided LMMSE bound and the non-orthogonal variant achieving more than double the pilot expansion gain of the single-user scheme with only a small NMSE loss.

Load-bearing premise

The whole pipeline assumes a real uplink channel is well approximated by one line-of-sight path plus a small number of single-bounce paths from discrete point scatterers, and that the degree of scatterer overlap between users ($\rho_k = L_k/L$) is known or can be estimated before estimation begins.

Editorial extensions

If this is right

Pilot overhead per user can be cut by a factor of 2 to 4 while keeping channel estimation error close to the orthogonal-pilot baseline, so a fixed pilot budget can support proportionally more users.
Scatterer localization accuracy improves with the number of users, because shared scatterers are observed and averaged across several users' estimates, reducing miss-detection probability and RMSE.
The user-grouping decision is made once per long-timescale phase and reused for many short-timescale transmissions, so the pilot-reuse gain comes at a low recurring computational cost.
Even with imperfect prior user-location information (simulated with standard deviation up to 20 m), the multi-user scheme degrades less than a MUSIC-based baseline, because fusing shared-scatterer observations partially cancels location errors.
The scheme applies specifically to TDD massive MIMO-OFDM uplinks, where reciprocity lets the estimated uplink channel serve as downlink CSI.

Reading between the lines

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

The same location-domain joint-sparsity idea could be carried over to FDD downlink estimation, since scatterer geometry is reciprocal even when channel coefficients are not; the paper does not address this direction.
If user density grows so that most users share scatterers, the pilot-reuse factor might be pushed higher, but the roughly 10% of same-group users closer than 50 m in the simulations suggests estimation error in scatterer positions is the limiting factor.
A natural experimental test would be to run the grouping-plus-turbo pipeline on measured urban channels with rich scattering; if diffuse and multi-bounce energy is large, the sparse single-bounce model may need extension to keep the promised gains.
The scheme could feed integrated sensing and communication systems, since the refined scatterer map it produces is itself a map of the physical environment, not only a channel estimate.

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.

Desk Editor's Note

read the letter

Short version: this is a genuine engineering contribution, not a repackaging. The new thing is the assembly: long-timescale scatterer localization (TST-MUSIC), DBSCAN-based association across users to find shared scatterers, graph-coloring/PSO to group users so they can reuse pilots, and a short-timescale turbo message-passing estimator that exploits the resulting location-domain joint sparsity. Each component exists, but the integrated two-timescale pipeline with location-domain spatial pilot reuse is, as far as I can tell, new. The paper also does most things right in evaluation: Quadriga UMa channels, K=200 users, sensible baselines (SU-OP, MUSIC+LS), and a genie-aided LMMSE bound. The message-passing derivation is detailed and looks self-consistent; the MU-OP curve approaching the genie bound is a useful sanity check.

The soft spots are real but not disqualifying. Most important: the prior parameters rho_k = L_k/L and lambda are load-bearing in the Module B updates (Eqs. 41-46), and the paper never says how they are obtained in practice or in the simulations. If the simulations set them from the true scatterer counts and support sizes, the reported 2.5-4x pilot reuse gain may be optimistic for a system that has to estimate its own environment. The long-timescale DBSCAN output could plausibly provide these estimates, but that step isn't described. This needs to be addressed.

Also: hyperparameters (DBSCAN eps/MinPts, PSO c1/c2, lambda, sigma_UE) aren't reported; there are no error bars, only 100 realizations; Eq. (25) has a typo (it minimizes over r_l but the expression uses r_l inside and has no apparent dependence on the estimated range), and Table I copies the wrong functional form for f_k^0. The graph-coloring fitness is a heuristic relaxation of the stated max-min problem, so the gap between (10) and (32) should be discussed.

Net: the central idea holds up and the evidence is mostly consistent with it, but the paper needs a revision that discloses the prior setup and adds robustness checks. I think it deserves a serious referee; a conditional acceptance with a request for the missing parameter settings and a discussion of rho_k/lambda estimation would be appropriate. If the authors can show the gain survives with estimated priors, this is a solid journal paper.

Referee Report

4 major / 5 minor

Summary. The paper proposes a two-timescale scheme for joint multi-user uplink channel estimation and localization in MIMO-OFDM systems. In the long-timescale phase, TST-MUSIC provides coarse per-user scatterer estimates, DBSCAN associates and refines shared scatterers across users, and a PSO-based graph-coloring algorithm groups users so that pilots can be spatially reused. In the short-timescale phase, the SEA-LD-TurboCE algorithm combines LMMSE estimation with location-domain message passing and EM-based grid/user-position refinement, exploiting a joint sparsity model of overlapping scatterers. Simulations with a QuaDRiGa UMa channel model compare the proposed MU-NP scheme with MU-OP, SU-OP, MUSIC+LS, and genie-aided LMMSE baselines, reporting pilot-reduction gains of 2.5-4x over SU-OP and near-genie NMSE for MU-OP.

Significance. If the results hold, the paper addresses a practically important problem: pilot overhead reduction in massive MIMO by exploiting physical scatterer sharing among nearby users. The two-timescale pipeline, the combination of environment learning with turbo channel estimation, and the use of an independent QuaDRiGa channel model are notable strengths. The central claim of pilot expansion gain, however, depends on prior parameters whose estimation is not demonstrated; the reported gains may therefore overstate what is achievable without oracle knowledge. With additional ablations and corrected notation, the contribution could be solid and useful.

major comments (4)

[Section II.C and Section III.C, Eqs. (12)-(15); Table I] The support variables are defined as binary 0/1 in Section II.C, but Eqs. (12) and (14) use delta functions of the form delta(s+1) and delta(s-1), which correspond to a +/-1 encoding. In contrast, Table I and the message-passing updates in Eqs. (41)-(46) use delta(s) and delta(s-1), a 0/1 encoding. This inconsistency makes the derivation of Module B in Section V ambiguous; please adopt a single convention consistently throughout the paper and verify that the message update equations match that convention.
[Section III.C, Eqs. (14)-(15); Section V, Eqs. (41)-(46); Section VI] The joint-support prior depends on rho_k = L_k/L and the sparsity rate lambda, and these parameters enter directly into the message updates (41)-(46). The paper does not describe how rho_k or lambda are estimated from the long-timescale TST-MUSIC/DBSCAN output, nor does it report the values used in simulation. If rho_k and lambda are set from the true L_k, L, and support statistics, then the pilot-reuse gains in Figs. 7 and 8 include oracle prior knowledge. Please provide an estimation procedure or an ablation study with mismatched or estimated rho_k and lambda; without this, the central claim of 2.5-4x pilot expansion is not yet established for a system that must learn its own environment.
[Section III.C, Eq. (22)] Equation (22) models the received group signal as a sum over users of (Phi_k x_k + z_k), i.e., a separate noise vector per user. In a real receiver there is a single additive noise realization per received signal; as written, the noise variance is inflated by the group size and is inconsistent with the LMMSE update in Eq. (33), which uses a single sigma_z^2. Please correct Eq. (22) to y_g = sum_k Phi_k x_k + z_g or otherwise reconcile the noise model.
[Section IV.C, Eq. (10), Eq. (32), Algorithm 1] The proposed graph-coloring method is presented as solving the max-min intra-group distance problem in Eq. (10), but the fitness function in Eq. (32) only penalizes same-colored adjacent vertices and the number of colors used; it does not directly incorporate the minimum distance. Algorithm 1 decreases d_adj until G colors suffice, which yields a feasible coloring for some threshold but is not guaranteed to maximize the minimum distance. Please state this approximation explicitly, and additionally report the gap to an upper bound or compare against a direct optimization baseline for the grouping objective.

minor comments (5)

[Section IV.A, Eq. (25)] In Eq. (25), the square-root symbol appears as a stray "q" in the typeset expression, and the delay estimated by TST-MUSIC is written as tau_l(p_UE,k) rather than with a hat; please fix the notation and the formula.
[Table I] In the row for f_0^k, the functional form is written as CN(x_q; x_{B,q}^{k,pri}, v_{B,q}^{k,pri}) but it should involve x_0^k, not x_q. The table also mixes N and CN notation; please make it uniform.
[Section IV.B and Section IV.C] The DBSCAN parameters epsilon and MinPts, the PSO acceleration coefficients c1 and c2, and the Algorithm 1 parameters Delta_d_adj and epsilon are not reported; please include these settings so that the simulations are reproducible.
[References] Reference [21] appears to contain duplicated volume/page information ("vol. 68, pp. 2598-2612, 2020" followed by "vol. 19, no. 5, pp. 3185-3198, 2020"); please correct the bibliography entry.
[Section IV.A] There is a typo in the sentence "Then we need to ulize ..."; it should read "utilize."

Circularity Check

1 steps flagged · score 6.0 of 10

The reported pilot-reuse gain is partially forced by true-overlap priors rho_k and lambda that are never estimated from the long-timescale output.

self definitional [Section III.C, Eqs. (14)-(15); message updates (44)-(45) in Section V.B; simulation setup Section VI with L=6]
"where ρk = Lk L represent the probabilities of sk q = 1 under the condition that sq = 1, depicting the degree of overlap between individual scatterers and global scatterers. ... where the initialization distribution is set to p (sq = 1) = λ, and λ determines the sparsity of the support vector. ... Vhq→sq (sq) ∝ hq (sq) = λδ (sq − 1) + (1 − λ)δ (sq) . ... where πout sk,q = ρkπk,out s,q"

The short-timescale Bayesian estimator is driven by these priors: Eq. (45) sets πout_sk,q = ρk πk,out_s,q and Eq. (44) sets hq(sq) = λδ(sq−1)+(1−λ)δ(sq). Thus the posterior support probabilities—the exact overlap/sparsity structure the algorithm claims to exploit—are fed with ground-truth statistics ρk = Lk/L and λ. No estimator for ρk or λ is given in Section IV or Algorithm 2; the simulation knows L = 6 from the Quadriga channel generation. The reported 2.5–4× pilot-reuse gain over SU-OP is therefore partly an oracle-prior gain rather than a fully estimated-environment gain.

full rationale

The central estimation pipeline has substantial independent content: scatterer positions are extracted by TST-MUSIC and refined by DBSCAN in Section IV, the short-timescale algorithm runs an LMMSE/turbo message-passing estimator with EM on Quadriga-generated channels in Section VI, and the method is compared against MUSIC+LS, SU-OP, and genie-aided LMMSE baselines. No load-bearing self-citation or imported uniqueness theorem appears; the references to prior turbo algorithms are algorithmic lineage rather than justification. However, the joint-sparsity prior that makes MU pilot reuse work is written directly in terms of the true support counts: ρk = Lk/L, and λ is the true support sparsity. The paper provides no procedure for estimating these prior parameters from the long-timescale output and uses L = 6 in the simulator, so the true values are available to the implementation. Because Eqs. (44)–(45) inject these true values into every message-passing posterior, the 2.5–4× pilot-reuse gain over SU-OP is partly attributable to oracle knowledge of the overlap structure rather than solely to the proposed estimation algorithms. This is a partial, self-definitional circularity in the performance claim, not in the whole derivation.

Assumptions & free parameters 5 free parameters · 3 assumptions · 0 invented entities

The paper introduces no new physical entities; the dynamic location-domain grid and support variables are algorithmic constructs, not postulates about new physics. The central claim rests instead on the single-bounce geometric model, the joint sparsity prior, and the delegated accuracy of TST-MUSIC.

free parameters (5)

lambda (support sparsity prior) = not reported
Sets the prior probability p(s_q = 1) in Eq. (15); the paper does not state how it is chosen or estimated.
rho_k (scatterer overlap probability) = L_k / L, exact values not reported
Used in Eq. (14) to model shared scatterers; requires knowing the number of scatterers per user, which the algorithm would normally need to estimate.
DBSCAN radius epsilon and minimum points MinPts = not reported
These control scatterer association in Section IV.B, but the paper never gives their values or a tuning procedure.
PSO acceleration coefficients c1, c2 = not reported
The graph-coloring solver in Section IV.C depends on these and other PSO parameters that are left unspecified.
sigma_UE (user location error standard deviation) = 5 m default, 20 m in robustness test
The prior user position error is an input to the long-timescale estimation; real deployments would need to measure this.

assumptions (3)

domain assumption Each user's channel is a sum of a LOS path and a few single-bounce NLOS paths with delays given by Eq. (5).
Invoked in Section II.A; all range estimation, grid initialization, and turbo estimation assume this geometry.
domain assumption Users share scatterers according to the joint sparsity prior in Section II.C with known conditional probabilities.
This is the foundation for both the user grouping and the SEA-LD-TurboCE prior; the paper assumes it rather than validating it against measurements.
domain assumption TST-MUSIC returns accurate angle and delay estimates.
Section IV.A delegates coarse scatterer localization to TST-MUSIC [26] without analyzing its error statistics or failure modes.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Scattering Environment Aware Joint Multi-user Channel Estimation and Localization with Spatially Reused Pilots." pith.science (2026). https://pith.science/paper/DLD3OHWU

@misc{pith2026250102252,
  author       = {Pith},
  title        = {Pith review of: Scattering Environment Aware Joint Multi-user Channel Estimation and Localization with Spatially Reused Pilots},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DLD3OHWU}},
  note         = {Machine review of arXiv:2501.02252}
}

read the original abstract

The increasing number of users leads to an increase in pilot overhead, and the limited pilot resources make it challenging to support all users using orthogonal pilots. By fully capturing the inherent physical characteristics of the multi-user (MU) environment, it is possible to reduce pilot costs and improve the channel estimation performance. In reality, users nearby may share the same scatterer, while users further apart tend to have orthogonal channels. This paper proposes a two-timescale approach for joint MU uplink channel estimation and localization in MIMO-OFDM systems, which fully captures the spatial characteristics of MUs. To accurately represent the structure of the MU channel, the channel is modeled in the 3-D location domain. In the long-timescale phase, the time-space-time multiple signal classification (TST-MUSIC) algorithm initially offers a rough approximation of scatterer positions for each user, which is subsequently refined through the scatterer association algorithm based on density-based spatial clustering of applications with noise (DBSCAN) algorithm. The BS then utilizes this prior information to apply a graph-coloring-based user grouping algorithm, enabling spatial division multiplexing of pilots and reducing pilot overhead. In the short timescale phase, a low-complexity scattering environment aware location-domain turbo channel estimation (SEA-LD-TurboCE) algorithm is introduced to merge the overlapping scatterer information from MUs, facilitating high-precision joint MU channel estimation and localization under spatially reused pilots. Simulation results verify the superior channel estimation and localization performance of our proposed scheme over the baselines.

Figures

Figures reproduced from arXiv: 2501.02252 by the authors.

**Figure 1.** MU uplink channel model. h NLOS k,p = X l∈Lk x k l e −j2πpf0τl(pUE,k)a (θl , ϕl), (4) where f0 is the subcarrier interval, c is the speed of light, and a (·) is the array response vector of the UPA antenna array. x k 0 and x k l are the complex gain of the LOS path and the l-th NLOS path of user k, respectively. Besides, τ0 (pUE,k) = rUE,k c is the delay of the LOS path and τl (pUE,k) is the delay of the l-th NLOS p… view at source ↗

**Figure 2.** Two-timescale joint MU channel estimation and localization scheme. [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗

**Figure 3.** Modules of the SEA-LD-TurboCE E step and message flow between different modules. [PITH_FULL_IMAGE:figures/full_fig_p019_3.png] view at source ↗

Figures from the paper (6 more)

**Figure 4.** Figure 4: Factor graph of the joint distribution. CN 0;V k,pri B . The factor graph GB of the joint distribution associated with this virtual AWGN observation model is shown in [PITH_FULL_IMAGE:figures/full_fig_p020_4.png]

**Figure 5.** Figure 5: The performance of DBSCAN-based scatterer association algorithm (SNR= [PITH_FULL_IMAGE:figures/full_fig_p025_5.png]

**Figure 6.** Figure 6: The user grouping performance of the proposed algorithm. [PITH_FULL_IMAGE:figures/full_fig_p026_6.png]

**Figure 7.** Figure 7: The NMSE performance versus pilot reduction factor. [PITH_FULL_IMAGE:figures/full_fig_p027_7.png]

**Figure 8.** Figure 8: The NMSE performance of channel estimation versus SNR. [PITH_FULL_IMAGE:figures/full_fig_p028_8.png]

**Figure 9.** Figure 9: The RMSE and miss detection performance of scatterer localization versus SNR. [PITH_FULL_IMAGE:figures/full_fig_p029_9.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

31 extracted references · 29 canonical work pages

[1]

Massive MIMO for next generation wireless systems,

E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, “Massive MIMO for next generation wireless systems,” IEEE Communications Magazine, vol. 52, no. 2, pp. 186–195, 2014

2014
[2]

Scaling up MIMO: Opportunities and challenges with very large arrays,

F. Rusek et al., “Scaling up MIMO: Opportunities and challenges with very large arrays,” IEEE Signal Processing Magazine, vol. 30, no. 1, pp. 40–60, 2012

work page 2012
[3]

Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing,

L. Cimini, “Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing,” IEEE Transactions on Communications , vol. 33, no. 7, pp. 665–675, 1985

work page 1985
[4]

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 Journal of Selected Topics in Signal Processing , vol. 8, no. 5, pp. 742–758, 2014

work page 2014
[5]

TS 38.211 V16.7.0, Technical Specification Group Radio Access Network; NR; Physical channels and modulation,

3GPP, “TS 38.211 V16.7.0, Technical Specification Group Radio Access Network; NR; Physical channels and modulation,” Sep. 2021

work page 2021
[6]

Improved SRS design and channel estimation for LTE-Advanced uplink,

X. Xia, H. Zhao, and C. Zhang, “Improved SRS design and channel estimation for LTE-Advanced uplink,” in Proc. IEEE 5th Int. Symp. MAPE EMC Technol. Wireless Commun. , IEEE, 2013, pp. 84–90

work page 2013
[7]

Massive MIMO communications,

T. Van Chien and E. Björnson, “Massive MIMO communications,” 5G Mobile Communications, Springer, 2017, pp. 77–116

work page 2017
[8]

Multi-User Pilot Pattern Optimization for Channel Extrapolation in 5G NR Systems

Yubo Wan, An Liu, Tony Q. S. Quek, “Multi-User Pilot Pattern Optimization for Channel Extrapolation in 5G NR Systems,” [Online]. Available: https://arxiv.org/abs/2407.10532

work page Pith review arXiv

Show all 31 references

[9]

A Survey of Non-Orthogonal Multiple Access for 5G,

K. Lu, Z. Wu and X. Shao, “A Survey of Non-Orthogonal Multiple Access for 5G,” 2017 IEEE 86th Vehicular Technology Conference (VTC-Fall), Toronto, ON, Canada, 2017, pp. 1-5

2017
[10]

Graph coloring based pilot allocation to mitigate pilot contamination for multi-cell massive MIMO systems, IEEE Communications Letters , 2015, 19(10): 1842-1845

Zhu X, Dai L, Wang Z. Graph coloring based pilot allocation to mitigate pilot contamination for multi-cell massive MIMO systems, IEEE Communications Letters , 2015, 19(10): 1842-1845

2015
[11]

Pilot power allocation through user grouping in multi-cell massive MIMO systems, IEEE Transactions on Communications , 2016, 65(4): 1561-1574

Liu P, Jin S, Jiang T, et al. Pilot power allocation through user grouping in multi-cell massive MIMO systems, IEEE Transactions on Communications , 2016, 65(4): 1561-1574. 32

2016
[12]

Adaptive Pilot Allocation Algorithm for Pilot Contamination Mitigation in TDD Massive MIMO Systems,

M. Alkhaled, E. Alsusa, and K. A. Hamdi, “Adaptive Pilot Allocation Algorithm for Pilot Contamination Mitigation in TDD Massive MIMO Systems,” 2017 IEEE Wireless Communications and Networking Conference (WCNC) , 2017, pp. 1-6

2017
[13]

Robust Multi-user Channel Tracking Scheme for 5G New Radio,

Y . Wan, G. Liu, A. Liu, and M. -J. Zhao, “Robust Multi-user Channel Tracking Scheme for 5G New Radio,” IEEE Transactions on Wireless Communications , vol. 23, no. 6, pp. 5878-5894, June 2024

2024
[14]

Channel measurements for large antenna arrays,

J. Hoydis, C. Hoek, T. Wild, and S. ten Brink, “Channel measurements for large antenna arrays,” Proc. Int. Symp. Wireless Commun. Syst., 2012, pp. 811–815

2012
[15]

Linear pre-coding performance in measured very-large MIMO channels,

X. Gao, O. Edfors, F. Rusek, and F. Tufvesson, “Linear pre-coding performance in measured very-large MIMO channels,” in Proc. Veh. Technol. Conf., 2011, pp. 1–5

2011
[16]

Downlink channel estimation in multiuser massive MIMO with hidden Markovian sparsity,

A. Liu, L. Lian, V . K. N. Lau, and X. Yuan, “Downlink channel estimation in multiuser massive MIMO with hidden Markovian sparsity,” IEEE Transactions on Signal Processing , vol. 66, no. 18, pp. 4796–4810, Sep. 2018

2018
[17]

Closed-Loop Autonomous Pilot and Compressive CSIT Feedback Resource Adaptation in Multi-User FDD Massive MIMO Systems,

A. Liu, F. Zhu and V . K. N. Lau, “Closed-Loop Autonomous Pilot and Compressive CSIT Feedback Resource Adaptation in Multi-User FDD Massive MIMO Systems,” IEEE Transactions on Signal Processing, vol. 65, no. 1, pp. 173–183, 1 Jan. 2017

2017
[18]

Distributed compressive CSIT estimation and feedback for FDD multi-user massive MIMO systems,

X. Rao and V . K. Lau, “Distributed compressive CSIT estimation and feedback for FDD multi-user massive MIMO systems,” IEEE Transactions on Signal Processing , vol. 62, no. 12, pp. 3261–3271, Jun. 2014

2014
[19]

Joint Channel Estimation and User Grouping for Massive MIMO Systems,

J. Dai, A. Liu and V . K. N. Lau, “Joint Channel Estimation and User Grouping for Massive MIMO Systems,” IEEE Transactions on Signal Processing , vol. 67, no. 3, pp. 622-637, 1 Feb.1, 2019

2019
[20]

Simultaneous localization and channel estimation for 5G mmWave MIMO communications,

B. Zhou, R. Wichman, L. Zhang, and Z. Luo, “Simultaneous localization and channel estimation for 5G mmWave MIMO communications,”Proc. IEEE 32nd Annu. Int. Symp. Pers. Indoor Mobile Radio Commun. , 2021, pp. 1208–1214

2021
[21]

Joint channel and location estimation of massive MIMO system with phase noise,

X. Zheng, A. Liu, and V . Lau, “Joint channel and location estimation of massive MIMO system with phase noise,” IEEE Transactions on Signal Processing , vol. 68, pp. 2598–2612, 2020. vol. 19, no. 5, pp. 3185–3198, 2020

2020
[22]

Soft channel estimation and localization for millimeter wave systems with multiple receivers,

X. Yang, C.-K. Wen, Y . Han, S. Jin, and A. L. Swindlehurst, “Soft channel estimation and localization for millimeter wave systems with multiple receivers,” IEEE Transactions on Signal Processing , pp. 1–15, 2022

2022
[23]

Joint Channel Parameter Estimation and Scatterers Localization,

J. Hong, J. Rodríguez-Piñeiro, X. Yin and Z. Yu, “Joint Channel Parameter Estimation and Scatterers Localization,” IEEE Transactions on Wireless Communications , vol. 22, no. 5, pp. 3324–3340, May 2023

2023
[24]

Joint Location Sensing and Channel Estimation for IRS-Aided mmWave ISAC Systems,

Z. Chen, M. -M. Zhao, M. Li, F. Xu, Q. Wu and M. -J. Zhao, “Joint Location Sensing and Channel Estimation for IRS-Aided mmWave ISAC Systems,” IEEE Transactions on Wireless Communications , vol. 23, no. 9, pp. 11985-12002, Sept. 2024

2024
[25]

Channel measurements for large antenna arrays

J. Hoydis, C. Hoek, T. Wild, and S. ten Brink, “Channel measurements for large antenna arrays” 2012 International Symposium on Wireless Communication Systems (ISWCS) , Paris, France, 2012, pp. 811-815

2012
[26]

TST-MUSIC for joint DOA delay estimation,

Y .-Y . Wang, J.-T. Chen, and W.-H. Fang, “TST-MUSIC for joint DOA delay estimation,” IEEE Transactions on Signal Processing, vol. 49, no. 4, pp. 721–729, Apr. 2001

2001
[27]

Historical development of the Newton–Raphson method

Ypma, Tjalling J. “Historical development of the Newton–Raphson method.” SIAM review 37.4 (1995): 531-551

1995
[28]

Particle swarm optimization in wireless sensor networks: A brief survey,

R. V . Kulkarni and G. K. Venayagamoorthy, “Particle swarm optimization in wireless sensor networks: A brief survey,” IEEE Transactions on Systems, Man, and Cybernetics C, vol. 41, no. 2, pp. 262–267, Mar. 2011

2011
[29]

Successive linear approximation VBI for joint sparse signal recovery and dynamic grid parameters estimation,

W. Xu, A. Liu, B. Zhou, and M.-j. Zhao, “Successive linear approximation VBI for joint sparse signal recovery and dynamic grid parameters estimation,” [Online]. Available: https://arxiv.org/pdf/2307.09149. 33

arXiv
[30]

An Entropy-Based Adaptive DBSCAN Clustering Algorithm and Its Application in THz Wireless Channels,

J. Luo et al., “An Entropy-Based Adaptive DBSCAN Clustering Algorithm and Its Application in THz Wireless Channels,” IEEE Transactions on Antennas and Propagation , vol. 71, no. 12, pp. 9830-9837, Dec. 2023

2023
[31]

Study on channel model for frequencies from 0.5 to 100 GHz (3GPP TR 38.901 version 16.1.0 release 16),

3GPP, “Study on channel model for frequencies from 0.5 to 100 GHz (3GPP TR 38.901 version 16.1.0 release 16),” Dec. 2019

2019

Pith tools

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

[1] [1]

Massive MIMO for next generation wireless systems,

E. G. Larsson, O. Edfors, F. Tufvesson, and T. L. Marzetta, “Massive MIMO for next generation wireless systems,” IEEE Communications Magazine, vol. 52, no. 2, pp. 186–195, 2014

2014

[2] [2]

Scaling up MIMO: Opportunities and challenges with very large arrays,

F. Rusek et al., “Scaling up MIMO: Opportunities and challenges with very large arrays,” IEEE Signal Processing Magazine, vol. 30, no. 1, pp. 40–60, 2012

work page 2012

[3] [3]

Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing,

L. Cimini, “Analysis and simulation of a digital mobile channel using orthogonal frequency division multiplexing,” IEEE Transactions on Communications , vol. 33, no. 7, pp. 665–675, 1985

work page 1985

[4] [4]

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 Journal of Selected Topics in Signal Processing , vol. 8, no. 5, pp. 742–758, 2014

work page 2014

[5] [5]

TS 38.211 V16.7.0, Technical Specification Group Radio Access Network; NR; Physical channels and modulation,

3GPP, “TS 38.211 V16.7.0, Technical Specification Group Radio Access Network; NR; Physical channels and modulation,” Sep. 2021

work page 2021

[6] [6]

Improved SRS design and channel estimation for LTE-Advanced uplink,

X. Xia, H. Zhao, and C. Zhang, “Improved SRS design and channel estimation for LTE-Advanced uplink,” in Proc. IEEE 5th Int. Symp. MAPE EMC Technol. Wireless Commun. , IEEE, 2013, pp. 84–90

work page 2013

[7] [7]

Massive MIMO communications,

T. Van Chien and E. Björnson, “Massive MIMO communications,” 5G Mobile Communications, Springer, 2017, pp. 77–116

work page 2017

[8] [8]

Multi-User Pilot Pattern Optimization for Channel Extrapolation in 5G NR Systems

Yubo Wan, An Liu, Tony Q. S. Quek, “Multi-User Pilot Pattern Optimization for Channel Extrapolation in 5G NR Systems,” [Online]. Available: https://arxiv.org/abs/2407.10532

work page Pith review arXiv