Pith. sign in

REVIEW 3 major objections 5 minor 34 references

Sub-Connected Hybrid Beamfocusing Design for RSMA-Enabled Near-Field Communications with Imperfect CSI and SIC

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

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

Pith's one-line read This paper argues that near-field beamfocusing cannot fully suppress multiuser interference even with perfect CSI when the number of RF chains is limited, and that rate-splitting multiple access (RSMA) with a sub-connected hybrid…

desk verdict Useful incremental RSMA/near-field paper with a clean algorithm story, but the printed SINR and constraint have typos that need fixing before the simulation claims are fully trustworthy. read the letter →

arxiv 2507.11854 v1 pith:D4LCBVKI submitted 2025-07-16 cs.IT eess.SPmath.IT

Jiasi Zhou , Ruirui Chen , Yanjing Sun , Chintha Tellambura This is my paper · ORCID
classification cs.ITeess.SPmath.IT
keywords near-fieldcommunicationsrate-splittingmultipleaccessbeamfocusinghybridanalog-digitalarchitectureimperfectCSISICmax-minfairnessblockcoordinatedescent
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper asks whether near-field beamfocusing alone can remove multiuser interference so that advanced interference management becomes unnecessary, and answers no when the array uses a limited number of RF chains. It then proposes an RSMA downlink scheme with a sub-connected hybrid analog-digital beamfocuser, designs algorithms to maximize the minimum user rate under imperfect CSI and imperfect SIC, and reports that RSMA beats SDMA and that the sub-connected architecture nearly matches full-digital precoding while using far fewer RF chains. The work matters because it sets expectations for what near-field physical-layer processing can and cannot accomplish in practical 6G hardware.

What carries the argument

The near-field channel model uses the array response vector $a(r_k,\theta_k)$ with distance- and angle-dependent phases $\delta_{k,n} = \tilde{n} d \sin\theta_k - \frac{(\tilde{n} d)^2 \cos^2\theta_k}{2 r_k}$, which gives the spotlight-like focusing property. The rate target is a worst-case lower bound on the ergodic rate, derived by treating the CSI-error term as independent Gaussian interference via a generalized mutual-information argument (cited to [29]) and applying Jensen's inequality. The optimization alternates over three blocks using concave quadratic surrogates that minorize and match gradients of the logarithmic rates, a penalty term that enforces $P=FW$, closed-form analog phase updates $f^*_{l,m}=e^{-j\angle \psi_{l,m}^H}$, and a pseudoinverse digital update $W^*=(F^H F)^{-1} F^H P$. The low-complexity variant designs the analog beamfocuser by maximizing the minimum array gain with a swap-blocking RF-chain allocation, then optimizes the digital beamfocuser on the low-dimensional equivalent channel.

What would settle it

Run a Monte Carlo simulation of the actual received-signal model (6)-(9), including the SIC residual term $\Delta_k |h_k^H F w_0|^2$ in the private SINR, and compare the true max-min rate with the objective optimized by Algorithms 2 and 3; if RSMA-SHB no longer beats SDMA-SHB under imperfect CSI and imperfect SIC, the central claim would be falsified.

Watch

Extended reading notes

Core claim

The paper's central claim is that near-field spherical-wave beamfocusing does not fully suppress multiuser interference even with perfect CSI when the number of RF chains is limited (simulations use N=128 antennas and L=8 RF chains), so interference management such as RSMA is still necessary. Under imperfect CSI and imperfect SIC, the proposed RSMA transmission with a sub-connected hybrid analog-digital beamfocuser achieves a higher max-min rate than SDMA-based beamfocusing, and the sub-connected architecture reaches near-optimal (full-digital) performance while reducing the RF-chain requirement by a factor of 16. The paper establishes this by jointly optimizing the analog beamfocuser, the digital beamfocuser, and the common rate allocation, using a penalty-based block coordinate descent algorithm with closed-form beamfocuser updates, and by a lower-complexity two-stage variant that separates analog and digital design.

Load-bearing premise

The whole design optimizes lower bounds on the achievable rates that the paper takes from a generalized mutual-information argument cited to reference [29]; if that bound is not a true lower bound, or if the private-rate version in (16) omits the SIC residual term as written, the reported max-min rates may not be achieved by the actual system.

Editorial extensions

If this is right

  • Near-field beamfocusing with a limited number of RF chains is not a substitute for interference management: even perfect CSI leaves residual multiuser interference that RSMA's common stream can absorb.
  • RSMA remains beneficial under imperfect SIC, since its max-min rate degrades gracefully with the SIC error level while staying above SDMA, whose rate is flat but lower.
  • Sub-connected hybrid analog-digital beamfocusing offers a hardware-economical path to near-field gains, approaching full-digital rates with 16 times fewer RF chains.
  • The proposed low-complexity two-stage algorithm tracks the penalty-based BCD method closely, making the scheme practical without double-loop iterations.
  • The performance gap between RSMA and SDMA widens with transmit power and with the number of users, indicating that the scheme's advantage is largest where interference is strongest.

Reading between the lines

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

  • Because the displayed private-SINR bound (16) omits the SIC residual term $\Delta_k |\hat{h}_k^H p_0|^2$ that appears in the original model (9) and in (14), the simulated imperfect-SIC gains may be optimistic; a Monte Carlo check of the true SINR (9) would settle the discrepancy.
  • The near-parity between sub-connected HAD and full-digital beamfocusing at L=128 suggests that the value of RSMA over SDMA in near-field systems is largely a hardware-limited phenomenon: with enough RF chains, beamfocusing alone may approach interference-free operation.
  • The swap-based RF-chain allocation rule can be read as a general design principle for sub-connected near-field arrays, namely to assign sub-arrays by max-min array gain and refine by pairwise swaps; this may transfer to other near-field problems such as integrated sensing and communication design.
  • The worst-case Gaussian lower-bound technique, if valid, provides a template for robust precoding under norm-bounded CSI errors in other near-field multiuser setups, because it converts the expectation over the error into a deterministic quadratic form.
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. This paper studies a near-field multi-user downlink with RSMA, imperfect CSI (norm-bounded), imperfect SIC, and a sub-connected hybrid analog-digital architecture. It formulates a max-min rate problem over the analog beamfocuser, digital beamfocuser, and common-rate allocation, and proposes a penalty-based BCD algorithm with closed-form updates, plus a two-stage low-complexity variant. Simulations compare RSMA against SDMA and far-field beamforming across several operating conditions. The central claims are that beamfocusing alone cannot fully suppress multiuser interference even with perfect CSI, and that RSMA outperforms SDMA under imperfect CSI and SIC with the considered architecture.

Significance. If the technical development were sound, the paper would be a useful addition to the near-field communications literature: it addresses a timely question (whether beamfocusing makes advanced multiple access unnecessary), provides a systematic optimization framework with closed-form beamfocuser updates, and reports comparisons against full-digital and far-field baselines. The paper also demonstrates reasonable engineering effort, including a convergence and complexity analysis and a low-complexity design. However, several load-bearing rate expressions and reformulations are incorrect as printed, and these errors directly affect the validity of the claimed lower-bound objective and the RSMA-vs-SDMA comparison in the imperfect-SIC regime.

major comments (3)
  1. [Section III-A, Eq. (16)] The displayed lower bounds are not justified and appear to have the wrong inequality direction. In (13), the first line contains |h_k^H F w_0|^2 in the numerator while the second line replaces it with |\hat h_k^H F w_0|^2; this replacement is not guaranteed to be a lower bound, since the actual signal term can be smaller than the estimate-based term. The step labelled (a) also appears to invoke Jensen's inequality in a way that is inconsistent with the concavity of log: E[log(1+SNR)] <= log(1+E[SNR]), not >=. The citation to [29] does not supply this specific bound. Because the entire optimization objective (18) and the subsequent surrogate construction are built on these rate lower bounds, this is a load-bearing issue: without a valid lower bound, the maximized objective is not a reliable proxy for the achievable rate, and the simulation comparisons may not establish the paper's conclusions. The authors should either provide a correct worst-case lower bound (e.g., via triangle-inequality bounds on numerator and denominator) or state the exact conditions under which (13)-(14) hold.
  2. [Section III-A, Eq. (18e)] Equation (16) omits the SIC residual term from the private SINR. The definition of Δ_{k,i} in (17) sets Δ_{k,0}=Δ_k, but the summation in the denominator of (16) runs over i=1, i≠k, so the i=0 term is never included. The true post-SIC SINR in (9) contains Δ_k |h_k^H F w_0|^2, and the surrogate in (21b) correctly includes this term through Δ_{k,j} p_j^H x_{k,p} p_j with j=0. The omission makes \hat R_{k,p} larger than the actual private rate whenever Δ_k>0, which biases the max-min objective in favor of RSMA in the imperfect-SIC regime that the paper highlights. This internal inconsistency must be corrected; the authors should state explicitly which rate expression is used in the simulations and fix the printed formulation so that it matches the surrogate-based algorithm.
  3. [Section II-D, Eq. (14)] Constraint (18e) has the wrong inequality direction. It is written as ∑_{k=1}^K C_{k,c} ≥ \hat R_{k,c}, but the correct reformulation of (11c) is ∑_{k=1}^K C_{k,c} ≤ \hat R_{k,c} for each k, because the common rate cannot exceed the minimum common SINR. The corrected form appears in (25b) with ≤, so the printed problem (18) is not the problem that is actually solved. This is a significant reformulation error that needs to be rectified in the statement of the optimization problem.
minor comments (5)
  1. [Section IV-A and Algorithm 3] There is a typo in the second line of (14): the numerator of the log appears to be |\hat h_k^H F w_0|^2, but it should be |\hat h_k^H F w_k|^2 to match the private-stream SINR. This should be corrected for consistency with (9) and (16).
  2. [Abstract and Section I] The text uses 'State 1' and 'State 2' in Algorithm 3, while the body refers to 'Stage 1' and 'Stage 2'. The terminology should be unified.
  3. [Section III-C] The abstract phrases 'imperfect SCI' and the body sometimes says 'imperfect CSI'; the acronym should be consistent.
  4. [Section V] The convergence argument for the inner loop says the objective is non-decreasing because the achievable rate is lower-bounded; this is not sufficient to guarantee convergence to a stationary point. The authors should either state the standard assumptions under which the surrogate-based BCD converges to a stationary point or provide a more precise convergence statement.
  5. [Section V] The simulation section does not specify how the achievable rate is computed for the reported max-min rate. Given the discrepancy between (16) and the surrogate (21b), the authors should clearly state whether the curves are based on the printed rate expression or on the surrogate-based objective, as this is essential for interpreting Figures 2 and 3.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the paper's derivations and simulations are self-contained and do not reduce to their inputs.

full rationale

The paper's central claims are supported by an optimization problem and simulations that are not fitted to force the conclusions. The rate lower bounds in (13)-(14) are adopted from an external generalized mutual information framework [29], not from the authors' own prior results, and they are used as conservative surrogates rather than as predictions derived from fitted parameters. The self-citations to the authors' prior works ([12], [13], [16], [17]) appear only in the related-work discussion and are not load-bearing for the algorithm or the numerical comparisons. The low-complexity analog design follows external precedents [20], [34], and the surrogate optimization method cites external references [28], [31], [32]. No step in the derivation equates a claimed prediction with an input by construction, and no fitted parameter is renamed as a prediction. The apparent omission of the residual common-stream term in the displayed private SINR (16), and the questionable direction of constraint (18e), are correctness concerns rather than circularity; they do not make the derivation equivalent to its own assumptions.

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

The central results depend on standard near-field channel modeling assumptions, a norm-bounded error model, the generalized mutual information lower bound, and the surrogate optimization framework. Simulation parameters such as Δ_k and ε_k are chosen by hand and are not fitted to data. No new physical entities are introduced.

free parameters (3)
  • SIC imperfection factor Δ_k = 0.05
    Chosen simulation value; all users share the same residual common-signal fraction. It controls the core imperfect-SIC effect and is not derived from data.
  • Channel estimation error variance ε_k^2 = 0.005 ||hhat_k||^2
    Chosen to set the norm-bounded error region; scales with the estimated channel norm. Not fitted to data.
  • Penalty parameter ρ and reduction factor α = ρ=10^2, α=0.5
    Algorithm hyperparameters for the penalty-based BCD; settings are stated to align with prior works [25], [34].
assumptions (6)
  • domain assumption Norm-bounded CSI error model: ||htilde_k|| ≤ ε_k
    Formulated in Section II.A, equation (1); used to derive the worst-case rate lower bounds in (13)-(14).
  • domain assumption Near-field spherical wave channel with second-order Taylor expansion
    Section II.A, equations (2)-(4); central to the beamfocusing model.
  • standard math Generalized mutual information lower bound
    Used in (13)-(14) to replace the expectation over CSI error with a deterministic lower bound; cited to reference [29].
  • standard math Quadratic surrogate minorization and gradient consistency
    Claim 1, with proof deferred to reference [32]; used to construct concave surrogates in (21).
  • standard math Penalty-based BCD convergence to a stationary point
    Outer-loop convergence cited to reference [33]; inner-loop monotonic improvement argued in Section III.C.
  • domain assumption Unit-modulus phase-shifter constraint
    Sub-connected HAD hardware model, equation (11e).

how reviews work

0 comments
Cite this review

Pith. "Pith review of Sub-Connected Hybrid Beamfocusing Design for RSMA-Enabled Near-Field Communications with Imperfect CSI and SIC." pith.science (2026). https://pith.science/paper/D4LCBVKI

@misc{pith2026250711854,
  author       = {Pith},
  title        = {Pith review of: Sub-Connected Hybrid Beamfocusing Design for RSMA-Enabled Near-Field Communications with Imperfect CSI and SIC},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/D4LCBVKI}},
  note         = {Machine review of arXiv:2507.11854}
}
read the original abstract

Near-field spherical waves inherently encode both direction and distance information, enabling spotlight-like beam focusing for targeted interference mitigation. However, whether such beam focusing can fully eliminate interference under perfect and imperfect channel state information (CSI), rendering advanced interference management schemes unnecessary, remains an open question. To address this, we investigate rate-splitting multiple access (RSMA)-enabled near-field communications (NFC) under imperfect SCI. Our transmit scheme employs a sub-connected hybrid analog-digital (HAD) architecture to reduce hardware overhead while incorporating imperfect successive interference cancellation (SIC) for practical implementation. A minimum rate maximization problem is formulated by jointly optimizing the analog beamfocuser, the digital beamfocuser, and the common rate allocation. To solve the non-convex problem, we develop a penalty-based block coordinate descent (BCD) algorithm, deriving closed-form expressions for the optimal analog and digital beamfocusers solutions. Furthermore, to reduce computational complexity, we propose a low-complexity algorithm, where analog and digital beamfocusers are designed in two separate stages. Simulation results underscore that: 1) beamfocusing alone is insufficient to fully suppress interference even under perfect CSI; 2) RSMA exhibits superior interference management over SDMA under imperfect CSI and SIC conditions; 3) sub-connected HAD architecture delivers near-optimal digital beamfocusing performance with fewer radio frequency chains.

Figures

Figures reproduced from arXiv: 2507.11854 by the authors.

Figure 1
Figure 1. The considered RSMA-enabled NFC under imperfect CSI [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Max-min rate versus channel estimation error. [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Max-min rate versus SIC imperfection factor. [PITH_FULL_IMAGE:figures/full_fig_p009_3.png] view at source ↗
Figures from the paper (3 more)
Figure 5
Figure 5. Figure 5: Max-min rate versus the number of users. [PITH_FULL_IMAGE:figures/full_fig_p009_5.png]
Figure 6
Figure 6. Figure 6: Max-min rate versus transmit power threshold. [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 7
Figure 7. Figure 7: Convergence behavior of the proposed algorithms. [PITH_FULL_IMAGE:figures/full_fig_p010_7.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

34 extracted references · 30 canonical work pages

  1. [29]

    Rate-sp litting multiple access for downlink mimo: A generalized power iteration app roach,

    J. Park, J. Choi, N. Lee, W. Shin, and H. V . Poor, “Rate-sp litting multiple access for downlink mimo: A generalized power iteration app roach,” IEEE Trans. Wireless Commun. , vol. 22, no. 3, pp. 1588–1603, Mar. 2023

    work page 2023

  2. [1]

    Rate-splitting multipl e access for downlink communication systems: Bridging, generalizing, and outper- forming SDMA and NOMA,

    Y . Mao, B. Clerckx, and V . O. Li, “Rate-splitting multipl e access for downlink communication systems: Bridging, generalizing, and outper- forming SDMA and NOMA,” EURASIP J. Wireless Commun. Netw. , vol. 2018, no. 1, pp. 1–54, May 2018

    work page 2018

  3. [2]

    Movable antenn a en- hanced noma short-packet transmission,

    X. He, W. Chen, Q. Wu, X. Zhu, and N. Cheng, “Movable antenn a en- hanced noma short-packet transmission,” IEEE Commun. Lett. , vol. 28, no. 9, pp. 2196–2200, Sept. 2024

    work page 2024

  4. [3]

    Total delay op timization in cache-enabled C-RANs with hierarchical rate splitting,

    J. Zhou, Y . Sun, Q. Cao, and C. Tellambura, “Total delay op timization in cache-enabled C-RANs with hierarchical rate splitting, ” IEEE Trans. V eh. Technol., vol. 71, no. 11, pp. 11 832–11 846, Nov. 2022

    work page 2022

  5. [4]

    Ra te- splitting multiple access for 6G networks: Ten promising sc enarios and applications,

    J. Park, B. Lee, J. Choi, H. Lee, N. Lee, S.-H. Park, K.-J. L ee, J. Choi, S. H. Chae, S.-W. Jeon, K. S. Kwak, B. Clerckx, and W. Shin, “Ra te- splitting multiple access for 6G networks: Ten promising sc enarios and applications,” IEEE Netw., vol. 38, no. 3, pp. 128–136, May 2024

    work page 2024

  6. [5]

    A primer on rate-splitting multiple access: Tut orial, myths, and frequently asked questions,

    B. Clerckx, Y . Mao, E. A. Jorswieck, J. Y uan, D. J. Love, E. Erkip, and D. Niyato, “A primer on rate-splitting multiple access: Tut orial, myths, and frequently asked questions,” IEEE J. Select. Areas Commun., vol. 41, no. 5, pp. 1265–1308, May 2023

    work page 2023

  7. [6]

    Joint transmit a nd receive beamforming design in full-duplex integrated sensing and c ommunica- tions,

    Z. Liu, S. Aditya, H. Li, and B. Clerckx, “Joint transmit a nd receive beamforming design in full-duplex integrated sensing and c ommunica- tions,” IEEE J. Select. Areas Commun. , vol. 41, no. 9, pp. 2907–2919, Sept. 2023

    work page 2023

  8. [7]

    Rate-Splitting Multiple Access for Multi-Antenna Joint Radar and Communications with Partial CSIT: Precoder Optimization and Link-Level Simulations

    R. C. Loli, O. Dizdar, and B. Clerckx, “Rate-splitting mu ltiple ac- cess for multi-antenna joint radar and communications with partial CSIT: Precoder optimization and link-level simulations,” arXiv preprint arXiv:2201.10621, 2022

    work page Pith review arXiv 2022

Show all 34 references
  1. [8]

    RSMA-enabled aerial RIS-aided MU-MIMO system for improve d spectral-efficient URLLC,

    M. V . Katwe, R. Deshpande, K. Singh, M.-L. Ku, and B. Clerc kx, “RSMA-enabled aerial RIS-aided MU-MIMO system for improve d spectral-efficient URLLC,” IEEE Trans. V eh. Technol. , vol. 74, no. 2, pp. 3110–3127, Feb. 2025

    2025

  2. [9]

    Near- field communications: Research advances, potential, and ch allenges,

    J. An, C. Y uen, L. Dai, M. Di Renzo, M. Debbah, and L. Hanzo, “Near- field communications: Research advances, potential, and ch allenges,” IEEE Wirel. Commun. , vol. 31, no. 3, pp. 100–107, Jun. 2024

    2024

  3. [10]

    Near-field integrated sensing and comm unication: Opportunities and challenges,

    J. Cong, C. Y ou, J. Li, L. Chen, B. Zheng, Y . Liu, W. Wu, Y . G ong, S. Jin, and R. Zhang, “Near-field integrated sensing and comm unication: Opportunities and challenges,” IEEE Wirel. Commun., vol. 31, no. 6, pp. 162–169, Dec. 2024

    2024

  4. [11]

    Multiple access for holographic reconfigurable intelligent surface (HRIS)-aided near-field communications,

    S. Singh, K. Singh, S. K. Singh, H. Shin, and T. Q. Duong, “ Multiple access for holographic reconfigurable intelligent surface (HRIS)-aided near-field communications,” IEEE Internet Things J. , pp. 1–1, 2025, doi=10.1109/JIOT.2025.3567373

    2025

  5. [12]

    Joint beam s cheduling and resource allocation for flexible RSMA-aided near-field c ommuni- cations,

    J. Zhou, C. Zhou, Y . Mao, and C. Tellambura, “Joint beam s cheduling and resource allocation for flexible RSMA-aided near-field c ommuni- cations,” IEEE Wireless Commun. Lett. , vol. 14, no. 2, pp. 554–558, 2025

    2025

  6. [13]

    Flexible r ate- splitting multiple access for near-field integrated sensin g and communications,

    J. Zhou, C. Zhou, C. Zeng, and C. Tellambura, “Flexible r ate- splitting multiple access for near-field integrated sensin g and communications,” IEEE Trans. V eh. Technol. , pp. 1–5, 2025, doi=10.1109/TVT.2025.3546254

    2025

  7. [14]

    Rate - splitting multiple access for near-field communications wi th im- perfect CSIT and SIC,

    S. Zhang, F. Wang, Y . Mao, A.-L. Jin, and T. Q. Quek, “Rate - splitting multiple access for near-field communications wi th im- perfect CSIT and SIC,” IEEE Trans. Commun. , pp. 1–1, 2025, doi=10.1109/TCOMM.2025.3585513

    2025

  8. [15]

    Joint hybrid preco ding and rate allocation for RSMA in near-field and far-field massive M IMO communications,

    G. Zheng, M. Wen, J. Wen, and C. Shan, “Joint hybrid preco ding and rate allocation for RSMA in near-field and far-field massive M IMO communications,” IEEE Wireless Commun. Lett. , vol. 13, no. 4, pp. 1034–1038, Apr. 2024

    2024

  9. [16]

    Hybrid bea mforming design for RSMA-enabled near-field integrated sensing and c ommuni- cations,

    J. Zhou, C. Zhou, C. Tellambura, and G. Y . Li, “Hybrid bea mforming design for RSMA-enabled near-field integrated sensing and c ommuni- cations,” arXiv preprint arXiv:2412.17062 , 2024

    2024 arXiv

  10. [17]

    CRB-rate tr adeoff in RSMA-enabled near-field integrated multi-target sensing a nd multi-user communications,

    J. Zhou, C. Zhou, Y . Sun, and C. Tellambura, “CRB-rate tr adeoff in RSMA-enabled near-field integrated multi-target sensing a nd multi-user communications,” IEEE Trans. Cogn. Commun. Networking , pp. 1–1, 2025, doi=10.1109/TCCN.2025.3587818

    2025

  11. [18]

    A tutorial on near-fie ld XL- MIMO communications toward 6G,

    H. Lu, Y . Zeng, C. Y ou, Y . Han, J. Zhang, Z. Wang, Z. Dong, S . Jin, C.- X. Wang, T. Jiang, X. Y ou, and R. Zhang, “A tutorial on near-fie ld XL- MIMO communications toward 6G,” IEEE Commun. Surv. Tut. , vol. 26, no. 4, pp. 2213–2257, 4th, Quart. 2024

    2024

  12. [19]

    Near-field integrated sensin g and communications,

    Z. Wang, X. Mu, and Y . Liu, “Near-field integrated sensin g and communications,” IEEE Commun. Lett. , vol. 27, no. 8, pp. 2048–2052, Aug. 2023. 11

    2023

  13. [20]

    Simultaneo us wireless information and power transfer in near-field communication s,

    Z. Zhang, Y . Liu, Z. Wang, X. Mu, and J. Chen, “Simultaneo us wireless information and power transfer in near-field communication s,” IEEE Internet Things J. , vol. 11, no. 16, pp. 27 760–27 774, Aug. 2024

    2024

  14. [21]

    RSMA for hybrid RIS-UA V-aided full-duplex communications with fini te block- length codes under imperfect SIC,

    S. K. Singh, K. Agrawal, K. Singh, B. Clerckx, and C.-P . L i, “RSMA for hybrid RIS-UA V-aided full-duplex communications with fini te block- length codes under imperfect SIC,” IEEE Trans. Wireless Commun. , vol. 22, no. 9, pp. 5957–5975, Sept. 2023

    2023

  15. [22]

    Beam focusing for near-field multiuser MIMO communi cations,

    H. Zhang, N. Shlezinger, F. Guidi, D. Dardari, M. F. Iman i, and Y . C. Eldar, “Beam focusing for near-field multiuser MIMO communi cations,” IEEE Trans. Wireless Commun. , vol. 21, no. 9, pp. 7476–7490, Sept. 2022

    2022

  16. [23]

    Multiple access for near-field communi cations: SDMA or LDMA?

    Z. Wu and L. Dai, “Multiple access for near-field communi cations: SDMA or LDMA?” IEEE J. Select. Areas Commun. , vol. 41, no. 6, pp. 1918–1935, Jun. 2023

    1918

  17. [24]

    Physical la yer security in near-field communications,

    Z. Zhang, Y . Liu, Z. Wang, X. Mu, and J. Chen, “Physical la yer security in near-field communications,” IEEE Trans. V eh. Technol., vol. 73, no. 7, pp. 10 761–10 766, Jul. 2024

    2024

  18. [25]

    Near-field in tegrated sensing, positioning, and communication: A downlink and up link frame- work,

    H. Li, Z. Wang, X. Mu, P . Zhiwen, and Y . Liu, “Near-field in tegrated sensing, positioning, and communication: A downlink and up link frame- work,” IEEE J. Select. Areas Commun. , vol. 42, no. 9, pp. 2196–2212, Sept. 2024

    2024

  19. [26]

    Non-orthogonal multiple acce ss for near- field communications,

    J. Zuo, X. Mu, and Y . Liu, “Non-orthogonal multiple acce ss for near- field communications,” arXiv preprint arXiv:2304.13185 , 2023

    2023 arXiv

  20. [27]

    N ear-field communications: A tutorial review,

    Y . Liu, Z. Wang, J. Xu, C. Ouyang, X. Mu, and R. Schober, “N ear-field communications: A tutorial review,” IEEE open j. Commun. Soc , vol. 4, pp. 1999–2049, Sept. 2023

    1999

  21. [28]

    Optimization with first-order surrogate fu nctions,

    J. Mairal, “Optimization with first-order surrogate fu nctions,” in Int. Conf. Mach. Learn. PMLR, 2013, pp. 783–791

    2013

  22. [30]

    Joint and rob ust beam- forming framework for integrated sensing and communicatio n systems,

    J. Choi, J. Park, N. Lee, and A. Alkhateeb, “Joint and rob ust beam- forming framework for integrated sensing and communicatio n systems,” IEEE Trans. Wireless Commun., vol. 23, no. 11, pp. 17 602–17 618, Nov. 2024

    2024

  23. [31]

    Optimization trans fer using surrogate objective functions,

    K. Lange, D. R. Hunter, and I. Y ang, “Optimization trans fer using surrogate objective functions,” J. Comput. Graph. Statist. , vol. 9, no. 1, pp. 1–20, Mar. 2000

    2000

  24. [32]

    Caching at base stations wit h multi-cluster multicast wireless backhaul via accelerated first-order al gorithms,

    Y . Li, M. Xia, and Y .-C. Wu, “Caching at base stations wit h multi-cluster multicast wireless backhaul via accelerated first-order al gorithms,” IEEE Trans. Wireless Commun. , vol. 19, no. 5, pp. 2920–2933, May 2020

    2020

  25. [33]

    Penalty dual decomposition method f or non- smooth nonconvex optimization—part I: Algorithms and conv ergence analysis,

    Q. Shi and M. Hong, “Penalty dual decomposition method f or non- smooth nonconvex optimization—part I: Algorithms and conv ergence analysis,” IEEE Trans. Signal Process. , vol. 68, pp. 4108–4122, Jun. 2020

    2020

  26. [34]

    Beamfocusing optimization f or near-field wideband multi-user communications,

    Z. Wang, X. Mu, and Y . Liu, “Beamfocusing optimization f or near-field wideband multi-user communications,” IEEE Trans. Commun. , vol. 73, no. 1, pp. 555–572, Jan. 2025

    2025

Pith tools

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