Pith. sign in

REVIEW 3 major objections 4 minor 36 references

Piecewise Beam Training and Channel Estimation for RIS-Aided Near-Field Communications

T0 review · 3 major / 4 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 After one large-timescale estimate, a time-scaling identity lets every later RIS effective channel be recovered from roughly M/N_RF pilots per block, cutting pilot overhead 38–78% versus current methods.

desk verdict Promising overhead-reduction scheme for RIS near-field channel estimation, but the central full-rank theorem is false as stated and needs major revision. read the letter →

arxiv 2501.02985 v2 pith:HANJ7JSI submitted 2025-01-06 eess.SP

Jeongjae Lee , Songnam Hong This is my paper · ORCID
classification eess.SP
keywords reconfigurableintelligentsurfacenear-fieldcommunicationschannelestimationtwo-timescalepiecewisebeamtrainingmultipleleastsquareshybridbeamformingpilotoverhead
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

RIS-aided near-field systems have a quasi-static RIS-to-BS channel and a rapidly varying user-to-RIS channel, giving two very different coherence times. The paper's central claim is that once the initial effective channel is estimated on the slow timescale, every later effective channel can be written as that initial channel times a diagonal matrix built from an M×1 vector d_t, so only d_t needs to be estimated. It proposes piecewise beam training in which the RIS phases are structured so the observations become a multiple-least-squares problem in d_t, and proves (Theorem 1) a full-rank Gram matrix exists when the number of beam subframes B exceeds a computable threshold B_min, bringing per-block pilot overhead down to about M/N_RF. This is why a reader should care: the numbers translate to a 38–78% pilot-overhead reduction and about 98% lower computational complexity at M=512 relative to the baseline, and it works with half-duplex hybrid-array base stations rather than full-duplex operation.

What carries the argument

The load-bearing object is the time-scaling identity H_t^eff = H_0^eff diag(d_t), combined with piecewise beam training. The beam training splits the RIS into Q pieces and assigns each piece a beam vector v_b drawn from a unitary matrix; after a unitary transform at the receiver, each subframe gives a measurement whose sensing matrix is W_RF H_{q,0}^eff diag(v_b). Summing the normal equations over B subframes produces the Gram matrix G_q, whose rank is analyzed through the identity G_q = (V_B V_B^H) ∘ ((W_RF H_{q,0}^eff)^H W_RF H_{q,0}^eff) and the Hadamard-product rank inequality. The theorem that G_q is full rank for B ≥ B_min is what turns the multi-LS solution from underdetermined to unique and justifies the M/N_RF pilot count.

What would settle it

One concrete test: with the paper's own parameters (M=512, Q=16, N_RF=16, r_q=16), form G_q from (39) using DFT or Hadamard beam vectors with B=B_min=2; Theorem 1 predicts rank(G_q)=32. If numerical rank is below 32 for any q, the theorem fails and the M/N_RF overhead claim is not guaranteed. The paper's own Fig. 4 shows exactly this failure for the sparse channel, where the condition number stays high near B_min.

Watch

Extended reading notes

Core claim

The discovery is a structural identity: for t in the RIS-BS coherence window, H_t^eff = H_0^eff diag(d_t), with d_t = diag($h_UR^{0}$)^{-1} h_UR^t, so the entire fast-timescale channel variation is contained in one vector per block. The paper builds a channel estimator around it. The RIS reflection vector is split into Q pieces, each using a column of a unitary matrix as the piecewise beam; the received signals over B subframes yield B linear equations z_{[b,q,t]} = W_RF H_{q,0}^eff diag(v_b) d_{[q,t]} + noise, and the paper solves them jointly as a multi-LS problem. Its Gram matrix is G_q = (V_B V_B^H) ∘ ((W_RF H_{q,0}^eff)^H W_RF H_{q,0}^eff), and Theorem 1 asserts G_q is full rank whenever B ≥ B_min = max_q ceil(M/(Q min(N_RF, r̂_q))) and the beam subspaces from distinct subframes are distinct. With that, the per-block pilot overhead is about M/N_RF, independent of the number of pieces once each piece has rank at least N_RF, and simulations show the resulting NMSE beats the two-timescale low-rank baseline at reduced overhead in near-field and Rayleigh channels.

Load-bearing premise

The entire overhead saving rests on the claim that, for every pair of distinct beam-training subframes, the subspaces spanned by the r dominant rows of the measurement matrix are different, so their union spans the full M dimensions; the paper asserts this condition but does not prove it for the DFT or Hadamard matrices it actually uses, and the lemma supporting the proof does not establish linear independence of the combined vectors.

Editorial extensions

If this is right

  • Per-block pilot overhead drops from M to about M/N_RF, so the saving grows with the number of RF chains and with RIS size.
  • The two-timescale strategy no longer requires full-duplex base stations; it runs on a hybrid-array half-duplex BS, which is the standard architecture.
  • At fixed transmit power, higher SNR buys a directly measurable pilot reduction: the simulations report NMSE 10^-2 at about 128 pilots for 20 dB and below 64 pilots for 30 dB.
  • Small-timescale estimation complexity is O(M^3/Q^2), so splitting the RIS into more pieces trades a little extra initial estimation work for a large complexity cut, around 98% at M=512.
  • Estimation accuracy in later blocks is limited by the initial large-timescale estimate; Fig. 8 shows performance degrades when that first estimate is imperfect, so the first-block estimator must be accurate to realize the paper's gains.

Reading between the lines

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

  • Because the M/N_RF figure does not depend on Q once each piecewise rank reaches N_RF, the paper's own equations imply a clean operational tradeoff: pick Q for complexity, not for pilot count, and use the freed pilots for accuracy via B = 2B_min or 3B_min.
  • The same time-scaling-plus-piecewise-LS pattern should extend to any scenario where a slowly varying full matrix multiplies a fast-varying diagonal factor, such as a fixed reflector and a moving user; the paper does not explore this generalization.
  • The Gram-matrix ill-conditioning shown for sparse channels suggests the method is essentially tuned to high-rank near-field channels; a natural testable extension would make B adaptive to a condition-number threshold instead of a fixed multiple of B_min.
  • Using random phase vectors rather than deterministic DFT or Hadamard columns would make the subspace-distinctness condition in Theorem 1 hold with high probability, sidestepping the paper's unproven deterministic condition.
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 / 4 minor

Summary. The paper proposes a two-timescale channel estimation scheme, 2TCE-TSP, for RIS-aided near-field mmWave systems with hybrid beamforming. The key idea is to exploit the asymmetry between the long coherence time of the RIS-BS channel and the short coherence time of the user-RIS channel: the effective channel at block t is written as H_t^eff = H_0^eff diag(d_t), where d_t = diag(h_UR^0)^{-1} h_UR^t is a vector of length M. The initial effective channel is estimated once with the PW-CLRA method, and subsequent blocks are estimated by recovering only d_t from a piecewise beam training design. Each time block uses B subframes of Q pilots each, leading to a multiple-least-squares problem. The paper claims Theorem 1, which states that the Gram matrix of this problem is full rank when B >= B_min = max_q ceil(M/(Q min(N_RF, r_hat_q))) under a pairwise distinct-subspace condition, giving a per-block pilot overhead of about M/N_RF. Simulations show 38-78% pilot overhead reduction and roughly 98% complexity reduction at M=512 compared with the 2TCE-PWCLRA benchmark.

Significance. If the rank guarantee were valid, the proposed method would give a practically attractive reduction in pilot overhead and complexity for high-rank near-field channels, and the numerical comparisons across sparse, near-field, and Rayleigh fading channels are a useful empirical contribution. The paper also provides explicit formulas for pilot overhead and complexity and studies the effect of initial estimation error. However, the central theoretical result is false as stated: Lemma 1 is invalid, and Theorem 1 does not follow from its hypotheses. The distinct-subspace condition is neither verified for the proposed DFT/Hadamard training matrices nor sufficient for full rank. Because the M/N_RF overhead claim rests on this theorem, the theoretical support for the main contribution is currently missing. The underlying time-scaling idea and multi-LS formulation may still be salvageable, but the paper needs a corrected analysis or a clearly weakened claim.

major comments (3)
  1. [Section IV-A, Lemma 1 and Theorem 1] Lemma 1 is false. Two distinct r-dimensional subspaces of C^{Msub} can intersect nontrivially, so the 2r vectors in the lemma need not be linearly independent. The proof's observation that C([r+1:Msub],:) has no all-zero row shows only that each diag(v_b2*)u_i has some component outside V(v_b1*); it does not show that those components are mutually independent. Consequently Theorem 1 is false as stated. A concrete counterexample is Msub=4, r=2, B=2, v1=(1,1,1,1), v2=(1,-1,1,-1), and C = lambda1 e1 e1^H + lambda2 u2 u2^H with u2=(0,1,1,0)^T/sqrt(2) and lambda_i>0. Then V(v1*) = span(e1,u2) and V(v2*) = span(e1,(0,-1,1,0)^T/sqrt(2)) are distinct, yet the four spanning vectors have rank 3, so Rank(G_q)=3<Msub while all hypotheses of Theorem 1 hold with B=Bmin. Thus the unique-solution guarantee for the multi-LS problem in (37), and hence the M/N_RF overhead reduction in Table I and Section IV-C, is not established.
  2. [Section IV-A, distinct-subspace condition for DFT/Hadamard] The paper does not prove that the proposed beam training matrices (DFT or Hadamard columns) satisfy the condition V(v_b1*) != V(v_b2*) for all distinct b1,b2. More importantly, the counterexample above shows that even when this pairwise condition holds, the Gram matrix need not be full rank. A correct analysis must establish a stronger property, for example that the B subspaces V(v_b*) collectively span C^{Msub}, or must provide a different sufficient condition tied to the specific choice of vb. As written, the theoretical verification of the beam training design is absent.
  3. [Section III, Eq. (13) and Eq. (22)-(23)] The small-timescale channel is defined as d_t = diag(h_UR^0)^{-1} h_UR^t, which requires every entry of h_UR^0 to be nonzero. The visual-region model in Section II-B sets entries of f to zero with probability 1-p; if the LoS component is blocked and the NLoS component is absent at that element, then h_UR^0(m)=0 and the time-scaling property is undefined. The paper neither states a nonzero-entry assumption nor adapts the estimation to the support of h_UR^0. Since the entire reduction to estimating d_t depends on this inverse, this issue must be addressed explicitly.
minor comments (4)
  1. [Section III-B1] The text refers to 'the optimal analog combiner WRB'; this appears to be a typo for WRF.
  2. [Section III, Eq. (12)] The 'time-scaling property' in (12) is a definitional identity: d_t is chosen so that the factorization holds. The wording 'derive' overstates the content; please state explicitly that (12) is the definition of d_t, subject to the invertibility condition in (13).
  3. [Section III-B2, Eq. (44)] Equation (44) uses the notation kappa(G_q) before kappa is defined in (52). Please define the condition number, including the log scaling, before it is used in the noise-amplification bound.
  4. [Section IV-A, Fig. 4] The text says the large condition number at B=Bmin 'supports Theorem 1', but a large condition number is compatible with full rank and does not by itself confirm the rank. The interpretation should be softened to say that the condition number predicts practical estimation accuracy.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the central estimation method is an algebraic reparameterization plus a linear inverse problem, validated by simulation and external benchmarks.

full rationale

The two-timescale 'time-scaling property' in (12)-(13) is an algebraic identity: d_t is defined as diag(h_UR^0)^{-1} h_UR^t, so H_t^eff = H_0^eff diag(d_t) holds by substitution from (11). This is a reparameterization, not a fitted-input-called-prediction: d_t is not obtained from H_t^eff, but is the unknown solved from fresh pilot observations in the multi-LS problem (30)-(38) with sensing matrix A[b,q] built from the previously estimated H_0. The overhead and complexity claims are checked by Monte Carlo simulation (Section V) against the full-duplex 2TCE-FD baseline [23] and prior CLRA methods; no fitted parameter is renamed as a prediction. The paper does cite the authors' own PW-CLRA [22] as the large-timescale building block, but the downstream small-timescale method is evaluated both with perfect initial-channel assumption and with imperfect initial estimates (Fig. 8), so the central claim does not reduce to that self-citation. One correctness caveat, not a circularity: the proof of Theorem 1 via Lemma 1 (Section IV-A) is invalid because pairwise distinct r-dimensional subspaces may intersect nontrivially, so the 2r asserted spanning vectors need not be linearly independent; this undermines the sufficiency claim for full-rank G_q but does not make the derivation circular.

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

The central method rests on the reparameterization d_t (definitional), on the PW-CLRA initial estimate (external prior work), and on an unproven subspace distinctness condition. No new physical entities are introduced. The hand-chosen hyperparameters Q and B affect performance and complexity but are not fitted to the target NMSE.

free parameters (2)
  • Q (number of pieces) = 16 in simulations
    Chosen by hand; controls complexity O(M^3/Q^2) and pilot overhead; no principled selection rule given.
  • B (number of subframes) = 4 or 6 in simulations (2Bmin or 3Bmin)
    Chosen to improve the condition number of the Gram matrix; the paper notes B_min=2 is necessary but not sufficient for well-conditioned estimation.
assumptions (5)
  • standard math Rank inequality for Hadamard products: Rank(A∘B) <= Rank(A) Rank(B)
    Used in eq (36) and (40) to derive the necessary condition B_min; cited from [31].
  • ad hoc to paper V(v_b1*) != V(v_b2*) for all distinct b1,b2 in [B]
    Theorem 1 requires this to guarantee full-rank G_q; the paper does not prove it for the chosen v_b and the proof of Lemma 1 is insufficient.
  • domain assumption h_UR^0(m) != 0 for all m so that diag(h_UR^0)^{-1} exists
    Needed in (13); visual region vector f can contain zeros with probability 1-p, and the paper never addresses this.
  • domain assumption T = T_RB/T_UR is a positive integer
    Assumed to simplify indexing of time blocks in Section III.
  • domain assumption Estimated piecewise ranks satisfy r_hat_q >= N_RF for all q
    Required for B_min = M/(Q N_RF) and the M/N_RF overhead claim; stated as an assumption in the example (eq 53) but not validated.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Piecewise Beam Training and Channel Estimation for RIS-Aided Near-Field Communications." pith.science (2026). https://pith.science/paper/HANJ7JSI

@misc{pith2026250102985,
  author       = {Pith},
  title        = {Pith review of: Piecewise Beam Training and Channel Estimation for RIS-Aided Near-Field Communications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HANJ7JSI}},
  note         = {Machine review of arXiv:2501.02985}
}
read the original abstract

In this paper, we investigate the channel estimation challenge in reconfigurable intelligent surface (RIS)-aided near-field communication systems. Current channel estimation techniques require substantial pilot overhead and computational complexity, especially when the number of RIS elements is extremely large. To address this issue, we introduce a two-timescale channel estimation strategy that leverages the asymmetric coherence times of both the RIS-base station (BS) channel and the User-RIS channel. We derive a time-scaling property indicating that, for any two effective channels within the longer coherence time, one effective channel can be represented as the product of a vector, termed the small-timescale effective channel, and the other effective channel. By integrating the estimated effective channel from the initial time block with observations from our piecewise beam training, we present an efficient method for estimating subsequent small-timescale effective channels. We theoretically verify the efficacy of the proposed RIS design and demonstrate, through simulations, that our channel estimation method outperforms existing methods in pilot overhead and computational complexity across various realistic channel models.

Figures

Figures reproduced from arXiv: 2501.02985 by the authors.

Figure 1
Figure 1. The description of the RIS-aided near-field communication systems. [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. The relative eigenvalue ratio of the effective channels as a function [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗
Figure 3
Figure 3. The description of the proposed piecewise beam training at the [PITH_FULL_IMAGE:figures/full_fig_p007_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: The average condition number of the Gram matrices, i.e., [PITH_FULL_IMAGE:figures/full_fig_p009_4.png]
Figure 5
Figure 5. Figure 5: The NMSE on the number of pilot overhead, where [PITH_FULL_IMAGE:figures/full_fig_p012_5.png]
Figure 8
Figure 8. Figure 8: The NMSE on pilot overhead with the initial channel estimation error, [PITH_FULL_IMAGE:figures/full_fig_p012_8.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 31 canonical work pages

  1. [1]

    What should 6g be?

    S. Dang, O. Amin, B. Shihada, and M.-S. Alouini, “What should 6g be?” Nature Electronics, vol. 3, no. 1, pp. 20–29, 2020

    work page 2020

  2. [2]

    Twelve scientific challenges for 6g: Rethinking the foundations of communications the- ory,

    M. Chafii, L. Bariah, S. Muhaidat, and M. Debbah, “Twelve scientific challenges for 6g: Rethinking the foundations of communications the- ory,” IEEE Communications Surveys & Tutorials , vol. 25, no. 2, pp. 868–904, 2023

    2023

  3. [3]

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

    C.-X. Wang, X. You, X. Gao, X. Zhu, Z. Li, C. Zhang, H. Wang, Y . Huang, Y . Chen, H. Haas, J. S. Thompson, E. G. Larsson, M. D. Renzo, W. Tong, P. Zhu, X. Shen, H. V . Poor, and L. Hanzo, “On the road to 6g: Visions, requirements, key technologies, and testbeds,” IEEE Communications Surveys & Tutorials, vol. 25, no. 2, pp. 905–974, 2023

    2023

  4. [4]

    Millimeter wave communication: A comprehensive survey,

    X. Wang, L. Kong, F. Kong, F. Qiu, M. Xia, S. Arnon, and G. Chen, “Millimeter wave communication: A comprehensive survey,” IEEE Communications Surveys & Tutorials , vol. 20, no. 3, pp. 1616–1653, 2018

    work page 2018

  5. [5]

    Terahertz communications and sensing for 6g and beyond: A comprehensive review,

    W. Jiang, Q. Zhou, J. He, M. A. Habibi, S. Melnyk, M. El-Absi, B. Han, M. D. Renzo, H. D. Schotten, F.-L. Luo, T. S. El-Bawab, M. Juntti, M. Debbah, and V . C. M. Leung, “Terahertz communications and sensing for 6g and beyond: A comprehensive review,” IEEE Communications Surveys & Tutorials, vol. 26, no. 4, pp. 2326–2381, 2024

    work page 2024

  6. [6]

    Non-stationarities in extra-large-scale massive mimo,

    E. D. Carvalho, A. Ali, A. Amiri, M. Angjelichinoski, and R. W. Heath, “Non-stationarities in extra-large-scale massive mimo,” IEEE Wireless Communications, vol. 27, no. 4, pp. 74–80, 2020

    work page 2020

  7. [7]

    Smart radio environments empowered by reconfigurable intelligent surfaces: How it works, state of research, and the road ahead,

    M. Di Renzo, A. Zappone, M. Debbah, M.-S. Alouini, C. Yuen, J. De Rosny, and S. Tretyakov, “Smart radio environments empowered by reconfigurable intelligent surfaces: How it works, state of research, and the road ahead,” IEEE journal on selected areas in communications, vol. 38, no. 11, pp. 2450–2525, 2020

    work page 2020

  8. [8]

    Ris-aided wireless communications: Prototyping, adaptive beamforming, and indoor/outdoor field trials,

    X. Pei, H. Yin, L. Tan, L. Cao, Z. Li, K. Wang, K. Zhang, and E. Bj¨ornson, “Ris-aided wireless communications: Prototyping, adaptive beamforming, and indoor/outdoor field trials,” IEEE Transactions on Communications, vol. 69, no. 12, pp. 8627–8640, 2021

    2021

Show all 36 references
  1. [9]

    Intelligent reflecting surface-aided wireless communications: A tutorial,

    Q. Wu, S. Zhang, B. Zheng, C. You, and R. Zhang, “Intelligent reflecting surface-aided wireless communications: A tutorial,” IEEE transactions on communications, vol. 69, no. 5, pp. 3313–3351, 2021

    2021

  2. [10]

    Reconfigurable intelligent surface- aided near-field communications for 6g: Opportunities and challenges,

    X. Mu, J. Xu, Y . Liu, and L. Hanzo, “Reconfigurable intelligent surface- aided near-field communications for 6g: Opportunities and challenges,” IEEE Vehicular Technology Magazine, vol. 19, no. 1, pp. 65–74, 2024

    2024

  3. [11]

    Ris- aided near-field mimo communications: Codebook and beam training design,

    S. Lv, Y . Liu, X. Xu, A. Nallanathan, and A. L. Swindlehurst, “Ris- aided near-field mimo communications: Codebook and beam training design,” IEEE Transactions on Wireless Communications, vol. 23, no. 9, pp. 12 531–12 546, 2024

    2024

  4. [12]

    A survey on model- based, heuristic, and machine learning optimization approaches in ris- aided wireless networks,

    H. Zhou, M. Erol-Kantarci, Y . Liu, and H. V . Poor, “A survey on model- based, heuristic, and machine learning optimization approaches in ris- aided wireless networks,” IEEE Communications Surveys & Tutorials , vol. 26, no. 2, pp. 781–823, 2024

    2024

  5. [13]

    Spherical wave channel and analysis for large linear array in los conditions,

    Z. Zhou, X. Gao, J. Fang, and Z. Chen, “Spherical wave channel and analysis for large linear array in los conditions,” in 2015 IEEE Globecom Workshops (GC Wkshps), 2015, pp. 1–6

    2015

  6. [14]

    Near-field channel estimation in mixed los/nlos envi- ronments for extremely large-scale mimo systems,

    Y . Lu and L. Dai, “Near-field channel estimation in mixed los/nlos envi- ronments for extremely large-scale mimo systems,” IEEE Transactions on Communications, vol. 71, no. 6, pp. 3694–3707, 2023

    2023

  7. [15]

    Near-field wideband beamforming for extremely large antenna arrays,

    M. Cui and L. Dai, “Near-field wideband beamforming for extremely large antenna arrays,” IEEE Transactions on Wireless Communications , vol. 23, no. 10, pp. 13 110–13 124, 2024

    2024

  8. [16]

    Near-field rainbow: Wideband beam training for xl-mimo,

    M. Cui, L. Dai, Z. Wang, S. Zhou, and N. Ge, “Near-field rainbow: Wideband beam training for xl-mimo,” IEEE Transactions on Wireless Communications, vol. 22, no. 6, pp. 3899–3912, 2023

    2023

  9. [17]

    Channel estimation for reconfigurable intelligent surface aided multi-user mmwave mimo systems,

    J. Chen, Y .-C. Liang, H. V . Cheng, and W. Yu, “Channel estimation for reconfigurable intelligent surface aided multi-user mmwave mimo systems,” IEEE Transactions on Wireless Communications , no. 10, pp. 6853–6869, 2023

    2023

  10. [18]

    Channel estimation for hybrid ris aided mimo communications via atomic norm minimization,

    R. Schroeder, J. He, and M. Juntti, “Channel estimation for hybrid ris aided mimo communications via atomic norm minimization,” in 2022 IEEE International Conference on Communications Workshops (ICC Workshops). IEEE, 2022, pp. 1219–1224

    2022

  11. [19]

    Channel estimation for near-field xl-ris-aided mmwave hybrid beamforming architectures,

    S. Yang, W. Lyu, Z. Hu, Z. Zhang, and C. Yuen, “Channel estimation for near-field xl-ris-aided mmwave hybrid beamforming architectures,” IEEE Transactions on Vehicular Technology, vol. 72, no. 8, pp. 11 029– 11 034, 2023

    2023

  12. [20]

    Near-field channel estimation for extremely large-scale reconfigurable intelligent surface (xl-ris)-aided wideband mmwave systems,

    S. Yang, C. Xie, W. Lyu, B. Ning, Z. Zhang, and C. Yuen, “Near-field channel estimation for extremely large-scale reconfigurable intelligent surface (xl-ris)-aided wideband mmwave systems,” IEEE Journal on Selected Areas in Communications, vol. 42, no. 6, pp. 1567–1582, 2024

    2024

  13. [21]

    Near-field channel estimation for xl-ris assisted multi-user xl-mimo systems: Hybrid beam- forming architectures,

    J. Lee, H. Chung, Y . Cho, S. Kim, and S. Hong, “Near-field channel estimation for xl-ris assisted multi-user xl-mimo systems: Hybrid beam- forming architectures,” IEEE Transactions on Communications, vol. 73, no. 3, pp. 1560–1574, 2025

    2025

  14. [22]

    Near-field los/nlos channel estimation for ris-aided mu-mimo systems: Piece-wise low-rank approximation approach,

    J. Lee and S. Hong, “Near-field los/nlos channel estimation for ris-aided mu-mimo systems: Piece-wise low-rank approximation approach,” IEEE Transactions on Wireless Communications , pp. 1–1, 2025

    2025

  15. [23]

    Two-timescale channel estimation for reconfigurable intelligent surface aided wireless communications,

    C. Hu, L. Dai, S. Han, and X. Wang, “Two-timescale channel estimation for reconfigurable intelligent surface aided wireless communications,” IEEE Transactions on Communications, vol. 69, no. 11, pp. 7736–7747, 2021

    2021

  16. [24]

    Channel estimation for xl-ris-aided millimeter-wave systems,

    X. Yu, W. Shen, R. Zhang, C. Xing, and T. Q. S. Quek, “Channel estimation for xl-ris-aided millimeter-wave systems,” IEEE Transactions on Communications, vol. 71, no. 9, pp. 5519–5533, 2023

    2023

  17. [25]

    A tutorial on near-field xl-mimo communications toward 6g,

    H. Lu, Y . Zeng, C. You, Y . Han, J. Zhang, Z. Wang, Z. Dong, S. Jin, C.-X. Wang, T. Jiang, X. You, and R. Zhang, “A tutorial on near-field xl-mimo communications toward 6g,” IEEE Communications Surveys & Tutorials, vol. 26, no. 4, pp. 2213–2257, 2024

    2024

  18. [26]

    Stochastic modeling of thz indoor radio channels,

    S. Priebe and T. Kurner, “Stochastic modeling of thz indoor radio channels,” IEEE Transactions on Wireless Communications , vol. 12, no. 9, pp. 4445–4455, 2013

    2013

  19. [27]

    Non-stationary channel estimation for extremely large-scale mimo,

    Y . Chen and L. Dai, “Non-stationary channel estimation for extremely large-scale mimo,” IEEE Transactions on Wireless Communications , vol. 23, no. 7, pp. 7683–7697, 2024

    2024

  20. [28]

    Non-stationary channel estimation for xl-mimo with hybrid structure via low-rank matrix completion,

    Y . Wu, C. Liu, Y . Song, W. Zhang, and Z. Huang, “Non-stationary channel estimation for xl-mimo with hybrid structure via low-rank matrix completion,” IEEE Communications Letters , pp. 1–1, 2025

    2025

  21. [29]

    Two-timescale joint precoding design and ris optimization for user tracking in near- field mimo systems,

    S. Palmucci, A. Guerra, A. Abrardo, and D. Dardari, “Two-timescale joint precoding design and ris optimization for user tracking in near- field mimo systems,” IEEE Transactions on Signal Processing , vol. 71, pp. 3067–3082, 2023

    2023

  22. [30]

    Two-timescale design for reconfigurable intelligent surface-aided massive mimo systems with imperfect csi,

    K. Zhi, C. Pan, H. Ren, K. Wang, M. Elkashlan, M. D. Renzo, R. Schober, H. V . Poor, J. Wang, and L. Hanzo, “Two-timescale design for reconfigurable intelligent surface-aided massive mimo systems with imperfect csi,” IEEE Transactions on Information Theory, vol. 69, no. 5, pp....

    2023

  23. [31]

    The singular values of a hadamard product: A basic inequality,

    T. Ando, R. A. Horn, and C. R. Johnson, “The singular values of a hadamard product: A basic inequality,” Linear and Multilinear Algebra , vol. 21, no. 4, pp. 345–365, 1987

    1987

  24. [32]

    Linear algebra and its applications,

    G. Strang, “Linear algebra and its applications,” 2000

    2000

  25. [33]

    All-digital self-interference cancellation technique for full-duplex systems,

    E. Ahmed and A. M. Eltawil, “All-digital self-interference cancellation technique for full-duplex systems,” IEEE Transactions on Wireless Communications, vol. 14, no. 7, pp. 3519–3532, 2015

    2015

  26. [34]

    Physical-layer security for full duplex communications with self-interference mitigation,

    F. Zhu, F. Gao, T. Zhang, K. Sun, and M. Yao, “Physical-layer security for full duplex communications with self-interference mitigation,” IEEE Transactions on Wireless Communications, vol. 15, no. 1, pp. 329–340, 2015

    2015

  27. [35]

    Channel estimation and self-interference cancelation in full-duplex communication systems,

    A. Masmoudi and T. Le-Ngoc, “Channel estimation and self-interference cancelation in full-duplex communication systems,” IEEE Transactions on Vehicular Technology, vol. 66, no. 1, pp. 321–334, 2016

    2016

  28. [36]

    Tse and P

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

    2005

Pith tools

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