Pith. sign in

REVIEW 4 major objections 5 minor 1 cited by

Hybrid Beamforming Design for RSMA-enabled Near-Field Integrated Sensing and Communications

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

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

Pith's one-line read The paper claims that for near-field integrated sensing and communications with RSMA, dedicated sensing beams are never needed: a rank-zero reconstruction of the optimal beamformers always achieves the same max-min communication rate…

desk verdict The paper's key theorem—that dedicated sensing beams are unnecessary in near-field ISAC—rests on a broken proof in Appendix B, though the algorithm and simulations still have heuristic value. read the letter →

arxiv 2412.17062 v2 pith:NECZY3UJ submitted 2024-12-22 cs.IT eess.SPmath.IT

Jiasi Zhou , Chintha Tellambura , Geoffrey Ye Li This is my paper · ORCID
classification cs.ITeess.SPmath.IT
keywords near-fieldISACrate-splittingmultipleaccesshybridbeamformingdedicatedsensingbeamsrank-zeroreconstructionpenaltydualdecompositionWMMSErate
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 tries to settle whether a near-field integrated sensing and communications (ISAC) base station needs separate sensing beams when it also serves users with rate-splitting multiple access (RSMA). It claims no: there is always an optimal solution in which the dedicated sensing beamformer is zero, because the communication beams can be rebuilt to carry the sensing load without hurting either task. If true, this removes the unknown beam-count variable from the design and lets all radio-frequency chains be spent on communication, which matters because near-field arrays are expensive and fully digital beamforming is impractical. The paper also contributes a penalty-dual-decomposition algorithm that optimizes the remaining hybrid beamformers, and simulations indicate near-digital performance with fewer RF chains and gains over far-field and conventional multiple-access baselines.

What carries the argument

The rank-zero solution reconstruction carries the no-sensing-beam conclusion. Proposition 1 redistributes the dedicated sensing covariance $\tilde{V}^*$ into the communication beamformers with weights $\delta_k$ summing to one; total transmit covariance is unchanged, so sensing rates are preserved, and because sensing interference moves into the useful signal terms, each communication SINR can only rise. Proposition 2 then takes a possibly high-rank $\hat{W}_k$ and produces a rank-one $\bar{W}_k$ by subtracting a null-space correction, using the linear dependence structure of the blocks $\hat{P}_k^H \hat{B}_i \hat{P}_k$ to guarantee $\mathrm{Tr}(\hat{B}_i \bar{W}_k)=\mathrm{Tr}(\hat{B}_i \hat{W}_k)$ for every sensing-channel and user-channel matrix in the problem. This converts the covariance-preserving absorption of sensing beams into a feasible rank-one communication solution, removing the discrete variable $N_s$ from the optimization. The subsequent algorithm machinery, PDD with WMMSE and quadratic transforms, optimizes the remaining hybrid beamformers.

What would settle it

Take a random near-field instance, solve the rank-relaxed problem to obtain $\tilde{W}_k^*$ and $\tilde{V}^*$, build $\hat{W}_k = \tilde{W}_k^* + \delta_k \tilde{V}^*$, apply the Appendix B rank reduction, and compute $\sum_{k=0}^{K} \mathrm{Tr}(F^H F \bar{W}_k)$; if this sum exceeds $P_{\mathrm{th}}$ for a case where the original solution was feasible, the claim that an optimal solution with $V=0$ always exists is false.

Watch

Extended reading notes

Core claim

On its own terms, the central discovery is that for the formulated max-min communication-rate problem with per-target sensing-rate constraints, there exists an optimal solution with $V=0$, meaning dedicated sensing beams are unnecessary for near-field multi-target detection. Starting from an optimal solution $(F^*, \tilde{W}_k^*, \tilde{V}^*, U^*, c^*)$, the paper constructs $\hat{W}_k = \tilde{W}_k^* + \delta_k \tilde{V}^*$ and $\hat{V}=0$ with $\sum_k \delta_k=1$, which preserves the transmit covariance, keeps the sensing rate unchanged, and weakly raises every communication SINR. It then rank-reduces each $\hat{W}_k$ to a rank-one $\bar{W}_k$ that preserves all sensing-channel and user-channel trace terms, so the chain $E(Q_3)=E(Q_2)\ge E(Q_1^*)$ forces equality and $Q_3$ is optimal. With $N_s^*=0$ established, the paper optimizes the remaining variables through a penalty-dual-decomposition double-loop algorithm using WMMSE and quadratic transforms, and simulations report that hybrid beamforming with few RF chains nearly matches fully digital beamforming while the sensing constraint costs only about $0.05$ bps/Hz.

Load-bearing premise

The load-bearing premise is that the reconstructed rank-one beams use no more transmit power than the original solution; the proof's trace equalities cover sensing-channel and user-channel matrices but not the power term $F^HF$, so power feasibility is asserted rather than established.

Editorial extensions

If this is right

  • With $N_s=0$, every RF chain can be assigned to communication streams, removing the sensing-beam count from the optimization and simplifying the remaining beamformer design.
  • Hybrid arrays with few RF chains can approach fully digital performance in the simulated regime, which matters because fully digital near-field arrays require one RF chain per antenna.
  • The sensing-rate requirement costs only about $0.05$ bps/Hz in the simulated setting, so multi-target detection is nearly free when communication beams are reused for sensing.
  • RSMA-based near-field ISAC outperforms SDMA, NOMA, and far-field ISAC in max-min rate, and the near-field advantage grows with the number of targets because spherical waves separate targets by distance as well as angle.
  • The rank-zero reconstruction removes the variable sensing-beam count from the design, a step that generalizes to other ISAC formulations with uncertain beam counts.

Reading between the lines

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

  • An implication not stated in the paper is that adding $F^HF$ to the set of matrices $\hat{B}_i$ in Proposition 2 would make the power step checkable; if the trace equality still holds, the $V=0$ conclusion becomes fully established, and if not, instances with $V\neq0$ may be optimal.
  • The rank-zero reconstruction idea transfers naturally to other designs with a variable number of dedicated beams or subarrays: replace the discrete count by a rank constraint, then reduce the rank while preserving the constraints that matter.
  • The simulation comparison at $R_{\mathrm{th}}=10$ bps/Hz removes infeasible channel realizations for the benchmarks, so the reported gains over SDMA and NOMA at that threshold may partly reflect feasibility filtering; counting infeasible cases as failures for every scheme would be a fairer test.
  • A separate untested consequence is that practical near-field ISAC transmitters could drop dedicated radar waveform slots and instead shape communication beams to cover the angular-distance region of interest, but that transfer is outside the paper's RSMA-based formulation.
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

4 major / 5 minor

Summary. The paper proposes an RSMA-based hybrid beamforming design for near-field ISAC with multiple communication users and multiple sensing targets. It formulates a max-min communication rate problem subject to transmit power, sensing-rate, common-rate, unit-modulus, and receive-filter constraints, with a variable number of dedicated sensing beams. The main theoretical claim is that dedicated sensing beams are unnecessary for NF multi-target detection, established through a solution-reconstruction argument (Propositions 1 and 2) that removes the sensing covariance. The rest of the paper develops a PDD-based double-loop algorithm using WMMSE and quadratic-transform reformulations, with closed-form updates for receive filters, digital beamformers, and analog beamformers, and evaluates the scheme in simulations against five baselines.

Significance. If the non-necessity theorem were valid, the paper would make a useful conceptual contribution to NF-ISAC beamforming, supporting the architectural simplification of omitting dedicated sensing beams. The system model is laid out clearly, and the simulation study is substantial: 100 channel realizations, five baselines, and comparisons over transmit power, RF-chain count, number of users and targets, and sensing-rate thresholds. The algorithmic machinery (PDD, WMMSE, quadratic transform) is standard but competently assembled, and the closed-form updates for the receive filters, digital beamformer, and analog beamformer are a practical strength. However, the central theorem's proof has load-bearing gaps concerning matrix dimensions and constraint preservation; the simulations do not repair those gaps because they already operate under the assumption that dedicated sensing beams are absent.

major comments (4)
  1. [Appendix B, Eq. (44)] The proof of Proposition 2 is dimensionally inconsistent. The matrices \hat W_k are digital beamformers in C^{N_f \times N_f}, so their factorization \hat W_k = \hat P_k \hat P_k^H has \hat P_k \in C^{N_f \times A_k}. However, the sensing matrices in (44) are G_a^H u_b u_b^H G_a \in C^{N_t \times N_t}; the product \hat P_k^H \hat B_i \hat P_k is undefined unless N_t = N_f, which the hybrid architecture explicitly excludes (N_f < N_t). The communication terms H_i are N_f \times N_f, so (44) mixes two incompatible dimensions. This invalidates the construction of B_k and the trace-preservation identity in (47).
  2. [Appendix B, Eqs. (45)-(47)] Even if the dimension issue were set aside, the trace preservation is established only for the matrices \hat B_i in (44), namely G_a^H u_b u_b^H G_a and H_i. The sensing SINR (10) depends on R = \sum_k F \tilde W_k F^H + F \tilde V F^H, so the relevant quadratic forms are Tr(F^H G_a^H u_b u_b^H G_a F \tilde W_k), not Tr(G_a^H u_b u_b^H G_a \tilde W_k). Since (44) omits F^H F, the proof does not show that the rank-reduced \bar W_k preserves the transmit power constraint (12b) or the sensing constraints (11c). The sentence in the proof that \bar W_k 'can meet constraints (12b), (12c), and (12e)' is therefore unsupported, and the central conclusion N_s^* = 0 in Section III does not follow.
  3. [Section III, Eq. (15)] The deduction that Q3 is an optimal solution relies on the chain E(Q3) = E(Q2) \ge E(Q1^*). Because the equality E(Q3) = E(Q2) is not established, as explained above, the statement 'there exists an optimal solution making V = 0' is not proven. At a minimum, the authors would need to demonstrate that the constructed rank-one \bar W_k simultaneously satisfies (12b), (12c), and all sensing constraints for N_f < N_t; the manuscript provides no such verification.
  4. [Section IV-D] The convergence discussion states both that the algorithm 'always yields globally optimal solutions' and that it 'converges to a stationary point within a finite number of iterations.' The first claim is not established by the monotonicity argument in (39) and is inconsistent with the second. Since the algorithm is a core contribution, this requires either a rigorous global-optimality proof or a corrected and more modest convergence claim.
minor comments (5)
  1. [Section I] The organization paragraph says 'Section IV provides simulation results' and 'Section V concludes,' but the simulations are in Section V and the conclusion is in Section VI.
  2. [Algorithm 1] Line 13 of Algorithm 1 outputs 'the maximized minimum sensing rate,' although problem (17) maximizes the minimum communication rate; this appears to be a typo.
  3. [Appendix B, Eq. (44)] The indexing in (44) is ambiguous for the boundary value: for i = M^2, the definitions a = \lfloor i/M \rfloor and b = i - aM give b = 0, which is not a valid target index. The index ranges should be stated more carefully.
  4. [Throughout] Notation is inconsistent in places, for example N_t versus Nt and \hat V versus \tilde V around equation (14); these should be harmonized.
  5. [Figure 2] Figure 2 contains garbled non-English characters in several block labels; the figure should be regenerated with clean text.

Circularity Check

0 steps flagged · score 1.0 of 10

No material circularity: the Section III reconstruction argument is an algebraic construction over the problem variables, and the self-citations are background only; the Appendix B concerns are non-circular proof gaps.

full rationale

The paper's central derivation is the solution-reconstruction chain in Section III. Proposition 1 (Appendix A) constructs \hat W_k = \tilde W_k^* + \delta_k \tilde V^* and \hat V = 0, preserving the transmit covariance by equation (41) and showing the communication rates do not decrease. Proposition 2 (Appendix B) then attempts a trace-preserving rank reduction of \hat W_k. This is an algebraic existence argument over the problem's own variables: the conclusion N_s^* = 0 follows, conditional on the construction being feasible, by exhibiting an optimal solution with V = 0. No parameter is fitted to a subset of data and then renamed a prediction, and no equation is defined in terms of the conclusion it is supposed to establish. The self-citations [6] and [31] appear only as related-work background and motivation, not as evidence for Proposition 1 or Proposition 2; Proposition 3 is explicitly derived from the external Theorem 2 of [40]. The referee's concern that Appendix B omits the transmit power matrix F^H F from the trace-preserving set \hat B_i and that the matrices in (44) have dimension N_t \times N_t while \hat P_k is N_f \times A_k is a genuine correctness gap in the proof, but it is not circularity: the proof fails to establish that (12b) is preserved, but that failure does not make the theorem an input to itself. The derivation is therefore self-contained with respect to circularity, and the identified weaknesses are non-circular mathematical flaws.

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

The central claim rests on modeling assumptions about the near-field channel, rank-one sensing channels, perfect self-interference cancellation, perfect CSI, and the algebraic reconstruction argument. No free parameters are fitted to data.

assumptions (6)
  • domain assumption Near-field channel is modeled by the second-order Taylor expansion of the distance (Eq. 2), valid in the radiating near-field region.
    This expansion is the basis for the NF array response vector a(r,theta) used throughout. If the approximation fails, all subsequent SINR expressions change.
  • domain assumption Round-trip sensing channel for each target is rank-one, G_m = beta_m b_m a_m^T (Eq. 4).
    Assumes single-point targets with no angular or range spread. Multi-path target reflections are excluded from the sensing model.
  • domain assumption Perfect self-interference cancellation between transmit and receive arrays.
    Section II-B assumes full decoupling; if residual self-interference exists, the sensing SINR (10) degrades.
  • domain assumption Perfect CSI for users and targets is available at the BS.
    The paper does not model channel estimation error; the algorithm optimizes using exact channels.
  • domain assumption Users and targets are all located within the Rayleigh distance (near-field region).
    Set in Section II; the spherical-wave model and all conclusions depend on this.
  • standard math WMMSE rate-MSE relationship (25) and quadratic transform (27) are exact given their respective optimizations.
    These are established results from [39] and [40], used to reformulate the non-convex rates.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Hybrid Beamforming Design for RSMA-enabled Near-Field Integrated Sensing and Communications." pith.science (2026). https://pith.science/paper/NECZY3UJ

@misc{pith2026241217062,
  author       = {Pith},
  title        = {Pith review of: Hybrid Beamforming Design for RSMA-enabled Near-Field Integrated Sensing and Communications},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/NECZY3UJ}},
  note         = {Machine review of arXiv:2412.17062}
}
read the original abstract

Integrated sensing and communication (ISAC) networks leverage extremely large antenna arrays and high frequencies. This inevitably extends the Rayleigh distance, making near-field (NF) spherical wave propagation dominant. This unlocks numerous spatial degrees of freedom, raising the challenge of optimizing them for communication and sensing tradeoffs. To this end, we propose a rate-splitting multiple access (RSMA)-based NF-ISAC transmit scheme utilizing hybrid analog-digital antennas. RSMA enhances interference management, while a variable number of dedicated sensing beams adds beamforming flexibility. The objective is to maximize the minimum communication rate while ensuring multi-target sensing performance by jointly optimizing receive filters, analog and digital beamformers, common rate allocation, and the sensing beam count. To address uncertainty in sensing beam allocation, a rank-zero solution reconstruction method demonstrates that dedicated sensing beams are unnecessary for NF multi-target detection. A penalty dual decomposition (PDD)-based double-loop algorithm is introduced, employing weighted minimum mean-squared error (WMMSE) and quadratic transforms to reformulate communication and sensing rates. Simulations reveal that the proposed scheme: 1) achieves performance comparable to fully digital beamforming with fewer RF chains, (2) maintains NF multi-target detection without compromising communication rates, and 3) significantly outperforms conventional multiple access schemes and far-field ISAC systems.

Figures

Figures reproduced from arXiv: 2412.17062 by the authors.

Figure 1
Figure 1. The considered RSMA-enabled NF-ISAC networks. [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. The block diagram of our algorithm, where these three [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 4
Figure 4. Max-min communication rate versus the number of RF [PITH_FULL_IMAGE:figures/full_fig_p010_4.png] view at source ↗
Figures from the paper (2 more)
Figure 7
Figure 7. Figure 7: (a) Max-min communication rate versus sensing rate. [PITH_FULL_IMAGE:figures/full_fig_p011_7.png]
Figure 8
Figure 8. Figure 8: Max-min communication rate versus the number of [PITH_FULL_IMAGE:figures/full_fig_p011_8.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

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

    cs.IT 2025-07 conditional novelty 4.0 of 10

    The authors develop a penalty-based BCD algorithm for RSMA-enabled near-field communications with sub-connected hybrid beamfocusing, and simulations indicate RSMA outperforms SDMA under imperfect CSI and SIC.

Reference graph

Works this paper leans on

42 extracted references · 35 canonical work pages · cited by 1 Pith paper

  1. [1]

    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 . Go ng, S. Jin, and R. Zhang, “Near-field integrated sensing and comm unication: Opportunities and challenges,” IEEE Wirel. Commun. , pp. 1–8, 2024, doi=10.1109/MWC.002.2400033

    work page doi:10.1109/mwc.002.2400033 2024

  2. [2]

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

    Z. Zhang, Y . Liu, Z. Wang, X. Mu, and J. Chen, “Simultaneou s 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. 13

    work page 2024

  3. [3]

    Rate-splitting multiple access for transmissive reconfig urable intelligent surface transceiver empowered ISAC systems,

    Z. Liu, W. Chen, Q. Wu, J. Y uan, S. Zhang, Z. Li, and J. Li, “Rate-splitting multiple access for transmissive reconfig urable intelligent surface transceiver empowered ISAC systems,” IEEE Internet Things J. , vol. 11, no. 16, pp. 27 245–27 259, Aug. 2024

    work page 2024

  4. [4]

    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

    2018

  5. [5]

    TTD configurations for near- field beamforming: Parallel, serial, or hybrid?

    Z. Wang, X. Mu, Y . Liu, and R. Schober, “TTD configurations for near- field beamforming: Parallel, serial, or hybrid?” IEEE Trans. Commun. , vol. 72, no. 6, pp. 3783–3799, Jun. 2024

    work page 2024

  6. [6]

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

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

    work page 2025

  7. [7]

    Rate-splitting multiple access: Fundamentals, sur vey, and future research trends,

    Y . Mao, O. Dizdar, B. Clerckx, R. Schober, P . Popovski, an d H. V . Poor, “Rate-splitting multiple access: Fundamentals, sur vey, and future research trends,” IEEE Commun. Surv. Tut. , vol. 24, no. 4, pp. 2073– 2126, 4th Quart. 2022

    work page 2022

  8. [8]

    Fundamental CRB-rate tradeoff in multi-antenna ISA C systems with information multicasting and multi-target sensing,

    Z. Ren, Y . Peng, X. Song, Y . Fang, L. Qiu, L. Liu, D. W. K. Ng, and J. Xu, “Fundamental CRB-rate tradeoff in multi-antenna ISA C systems with information multicasting and multi-target sensing,” IEEE Trans. Wireless Commun., vol. 23, no. 4, pp. 3870–3885, Apr. 2024

    work page 2024

Show all 42 references
  1. [9]

    ISAC meets SWIPT: Multi-functional wireless systems integrating sensing, c ommunication, and powering,

    Y . Chen, H. Hua, J. Xu, and D. W. K. Ng, “ISAC meets SWIPT: Multi-functional wireless systems integrating sensing, c ommunication, and powering,” IEEE Trans. Wireless Commun., vol. 23, no. 8, pp. 8264– 8280, Aug. 2024

    2024

  2. [10]

    Optimal coordin ated transmit beamforming for networked integrated sensing and communi- cations,

    G. Cheng, Y . Fang, J. Xu, and D. W. K. Ng, “Optimal coordin ated transmit beamforming for networked integrated sensing and communi- cations,” IEEE Trans. Wireless Commun., vol. 23, no. 8, pp. 8200–8214, Aug. 2024

    2024

  3. [11]

    Joint and ro- bust beamforming framework for integrated sensing and comm uni- cation systems,

    J. Choi, J. Park, N. Lee, and A. Alkhateeb, “Joint and ro- bust beamforming framework for integrated sensing and comm uni- cation systems,” IEEE Trans. Wireless Commun. , pp. 1–1, 2024, doi=10.1109/TWC.2024.3454987

    2024

  4. [12]

    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, Aug. 2023

    1999

  5. [13]

    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

    2023

  6. [14]

    Rate-sp litting multiple access for multi-antenna joint radar and communic ations,

    C. Xu, B. Clerckx, S. Chen, Y . Mao, and J. Zhang, “Rate-sp litting multiple access for multi-antenna joint radar and communic ations,” IEEE J. Sel. Top. Signal Process , vol. 15, no. 6, pp. 1332–1347, Nov. 2021

    2021

  7. [15]

    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

  8. [16]

    Towards 6G MIMO: Massive spatial multiplexing, dense arra ys, and interplay between electromagnetics and processing,

    E. Bjrnson, C. B. Chae, R. W. Heath, T. L. Marzetta, A. Mez ghani, L. Sanguinetti, F. Rusek, M. R. Castellanos, D. Jun, and Z. T. Demir, “Towards 6G MIMO: Massive spatial multiplexing, dense arra ys, and interplay between electromagnetics and processing,” arXiv preprint arXiv:...

    2024 arXiv

  9. [17]

    Energy-efficie nt MIMO integrated sensing and communications with on–off nontran smission power,

    G. Wu, Y . Fang, J. Xu, Z. Feng, and S. Cui, “Energy-efficie nt MIMO integrated sensing and communications with on–off nontran smission power,” IEEE Internet Things J. , vol. 11, no. 7, pp. 12 177–12 191, Apr. 2024

    2024

  10. [18]

    Cooperative cell -free ISAC networks: Joint BS mode selection and beamforming design,

    S. Liu, R. Liu, Z. Lu, M. Li, and Q. Liu, “Cooperative cell -free ISAC networks: Joint BS mode selection and beamforming design,” in IEEE Wireless Commun. Netw. Conf. (WCNC) , Spr. 2024, pp. 1–6

    2024

  11. [19]

    Intel ligent omni surfaces assisted integrated multi-target sensing and mul ti-user MIMO communications,

    Z. Zhang, W. Chen, Q. Wu, Z. Li, X. Zhu, and J. Y uan, “Intel ligent omni surfaces assisted integrated multi-target sensing and mul ti-user MIMO communications,” IEEE Trans. Commun., vol. 72, no. 8, pp. 4591–4606, Aug. 2024

    2024

  12. [20]

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

    Z. Liu, S. Aditya, H. Li, and B. Clerckx, “Joint transmit and 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

    2023

  13. [21]

    NOMA empo wered integrated sensing and communication,

    Z. Wang, Y . Liu, X. Mu, Z. Ding, and O. A. Dobre, “NOMA empo wered integrated sensing and communication,” IEEE Commun. Lett. , vol. 26, no. 3, pp. 677–681, Mar. 2022

    2022

  14. [22]

    On the stud y of non-orthogonal multiple access (NOMA)-assisted integr ated sensing and communication (ISAC),

    L. Sun, Z. Zhao, S. Wang, Z. Ding, and M. Peng, “On the stud y of non-orthogonal multiple access (NOMA)-assisted integr ated sensing and communication (ISAC),” IEEE Trans. Commun. , pp. 1–1, 2024, doi=10.1109/TCOMM.2024.3407202

    2024

  15. [23]

    Rate-splitt ing multiple access for simultaneous multi-user communication and mult i-target sensing,

    K. Chen, Y . Mao, L. Yin, C. Xu, and Y . Huang, “Rate-splitt ing multiple access for simultaneous multi-user communication and mult i-target sensing,” IEEE Trans. V eh. Technol., vol. 73, no. 9, pp. 13 909–13 914, Sept. 2024

    2024

  16. [24]

    Cooperative ISAC with direct localization and rate-splitting multiple access communication: A paret o optimization framework,

    P . Gao, L. Lian, and J. Y u, “Cooperative ISAC with direct localization and rate-splitting multiple access communication: A paret o optimization framework,” IEEE J. Select. Areas Commun. , vol. 41, no. 5, pp. 1496– 1515, May 2023

    2023

  17. [25]

    Joint rate splitting and beamforming design for RSMA-RIS-assist ed ISAC system,

    Z. Chen, J. Wang, Z. Tian, M. Wang, Y . Jia, and T. Q. S. Quek , “Joint rate splitting and beamforming design for RSMA-RIS-assist ed ISAC system,” IEEE Wireless Commun. Lett. , vol. 13, no. 1, pp. 173–177, Jan. 2024

    2024

  18. [26]

    Rate-splitting multiple access for quantized ISAC LEO satellite systems: A max-min fair ene rgy- efficient beam design,

    Z. Liu, L. Yin, W. Shin, and B. Clerckx, “Rate-splitting multiple access for quantized ISAC LEO satellite systems: A max-min fair ene rgy- efficient beam design,” IEEE Trans. Wireless Commun. , vol. 23, no. 10, pp. 15 394–15 408, Oct. 2024

    2024

  19. [27]

    Beamforming desi gn for near-field integrated sensing and communications,

    M. Lu, H. Luo, R. Liu, M. Li, and Q. Liu, “Beamforming desi gn for near-field integrated sensing and communications,” in IEEE 23rd Int. Conf. Commun. Technol. (ICCT) , Oct. 2023, pp. 434–438

    2023

  20. [28]

    Near- field ISAC: Beamforming for multi-target detection,

    D. Galappaththige, S. Zargari, C. Tellambura, and G. Y . Li, “Near- field ISAC: Beamforming for multi-target detection,” IEEE Wireless Commun. Lett. , vol. 13, no. 7, pp. 1938–1942, Jul. 2024

    1938

  21. [29]

    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

  22. [30]

    Simultaneous nea r-field THz communications and sensing with full duplex metasurface tr ansceivers,

    I. Gavras and G. C. Alexandropoulos, “Simultaneous nea r-field THz communications and sensing with full duplex metasurface tr ansceivers,” in IEEE 25th Int. W orkshop Signal Process. Adv. Wireless Commu n., 2024, pp. 126–130

    2024

  23. [31]

    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

  24. [32]

    Total delay o ptimization in cache-enabled C-RANs with hierarchical rate splitting,

    J. Zhou, Y . Sun, Q. Cao, and C. Tellambura, “Total delay o ptimization 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

    2022

  25. [33]

    Max-min fairne ss of rate- splitting multiple access with finite blocklength communic ations,

    Y . Xu, Y . Mao, O. Dizdar, and B. Clerckx, “Max-min fairne ss of rate- splitting multiple access with finite blocklength communic ations,” IEEE Trans. V eh. Technol., vol. 72, no. 5, pp. 6816–6821, May 2023

    2023

  26. [34]

    Sum- rate maximization in STAR-RIS-assisted RSMA networks: A PP O-based algorithm,

    C. Meng, K. Xiong, W. Chen, B. Gao, P . Fan, and K. B. Letaie f, “Sum- rate maximization in STAR-RIS-assisted RSMA networks: A PP O-based algorithm,” IEEE Internet Things J. , vol. 11, no. 4, pp. 5667–5680, Feb. 2024

    2024

  27. [35]

    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

  28. [36]

    RIS- aided near-field MIMO communications: Codebook and beam tra ining design,

    S. Lv, Y . Liu, X. Xu, A. Nallanathan, and A. L. Swindlehur st, “RIS- aided near-field MIMO communications: Codebook and beam tra ining design,” IEEE Trans. Wireless Commun. , vol. 23, no. 9, pp. 12 531– 12 546, Sept. 2024

    2024

  29. [37]

    Joint transmit beamforming for multiuser MIMO communications an d MIMO radar,

    X. Liu, T. Huang, N. Shlezinger, Y . Liu, J. Zhou, and Y . C. Eldar, “Joint transmit beamforming for multiuser MIMO communications an d MIMO radar,” IEEE Trans. Signal Process. , vol. 68, pp. 3929–3944, Jun. 2020

    2020

  30. [38]

    Composite sig- nalling for DFRC: Dedicated probing signal or not?

    L. Chen, F. Liu, J. Liu, and C. Masouros, “Composite sig- nalling for DFRC: Dedicated probing signal or not?” arXiv preprint arXiv:2009.03528, 2020

    2009 arXiv

  31. [39]

    Cooperative rat e splitting for MISO broadcast channel with user relaying, and performance benefits over cooperative NOMA,

    J. Zhang, B. Clerckx, J. Ge, and Y . Mao, “Cooperative rat e splitting for MISO broadcast channel with user relaying, and performance benefits over cooperative NOMA,” IEEE Signal Process. Lett. , vol. 26, no. 11, pp. 1678–1682, Nov. 2019

    2019

  32. [40]

    Fractional programming for communic ation systems-part I: Power control and beamforming,

    K. Shen and W. Y u, “Fractional programming for communic ation systems-part I: Power control and beamforming,” IEEE Trans. Signal Process., vol. 66, no. 10, pp. 2616–2630, May 2018

    2018

  33. [41]

    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

  34. [42]

    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

Pith tools

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