CRB-Rate Tradeoff in RSMA-Enabled Near-Field Integrated Multi-Target Sensing and Multi-User Communications

IF 8 1区 计算机科学 Q1 TELECOMMUNICATIONS
Jiasi Zhou;Cong Zhou;Yanjing Sun;Chintha Tellambura
{"title":"CRB-Rate Tradeoff in RSMA-Enabled Near-Field Integrated Multi-Target Sensing and Multi-User Communications","authors":"Jiasi Zhou;Cong Zhou;Yanjing Sun;Chintha Tellambura","doi":"10.1109/TCCN.2025.3587818","DOIUrl":null,"url":null,"abstract":"Near-field integrated sensing and communication (NF-ISAC) combines wireless communication with simultaneous angle and distance sensing. However, this dual functionality creates a complex interference environment. Existing NF-ISAC designs offer limited flexibility in managing such interference, highlighting the need for more advanced strategies. To address this, we propose a rate-splitting multiple access (RSMA) scheme for NF-ISAC, leveraging both fully and partially connected hybrid analog-digital (HAD) beamforming architectures. We derive the Cramér-Rao bound (CRB) for joint distance and angle sensing and characterize the tradeoff between the max-min communication rate and multi-target CRB. To explore the CRB-rate Pareto boundary, we formulate a sensing-centric optimization problem under communication rate constraints. For the fully connected HAD architecture, a penalty dual decomposition (PDD)-based double-loop algorithm is developed, while a two-stage approach is used to reduce complexity. This framework is also extended to the partially connected case. Simulations show that the proposed schemes achieve performance comparable to a fully digital beamformer with fewer RF chains, effectively balancing hardware efficiency and system performance. Furthermore, the schemes significantly outperform space division multiple access and far-field ISAC, delivering lower sensing error and an expanded CRB-rate region.","PeriodicalId":13069,"journal":{"name":"IEEE Transactions on Cognitive Communications and Networking","volume":"12 ","pages":"3687-3700"},"PeriodicalIF":8.0000,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Cognitive Communications and Networking","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/11077707/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/7/10 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Near-field integrated sensing and communication (NF-ISAC) combines wireless communication with simultaneous angle and distance sensing. However, this dual functionality creates a complex interference environment. Existing NF-ISAC designs offer limited flexibility in managing such interference, highlighting the need for more advanced strategies. To address this, we propose a rate-splitting multiple access (RSMA) scheme for NF-ISAC, leveraging both fully and partially connected hybrid analog-digital (HAD) beamforming architectures. We derive the Cramér-Rao bound (CRB) for joint distance and angle sensing and characterize the tradeoff between the max-min communication rate and multi-target CRB. To explore the CRB-rate Pareto boundary, we formulate a sensing-centric optimization problem under communication rate constraints. For the fully connected HAD architecture, a penalty dual decomposition (PDD)-based double-loop algorithm is developed, while a two-stage approach is used to reduce complexity. This framework is also extended to the partially connected case. Simulations show that the proposed schemes achieve performance comparable to a fully digital beamformer with fewer RF chains, effectively balancing hardware efficiency and system performance. Furthermore, the schemes significantly outperform space division multiple access and far-field ISAC, delivering lower sensing error and an expanded CRB-rate region.
基于rsma的近场集成多目标传感和多用户通信中的crb -速率权衡
近场集成传感和通信(NF-ISAC)将无线通信与同步角度和距离传感相结合。然而,这种双重功能创造了一个复杂的干扰环境。现有的NF-ISAC设计在管理这种干扰方面提供有限的灵活性,强调需要更先进的策略。为了解决这个问题,我们提出了一种用于NF-ISAC的速率分割多址(RSMA)方案,利用完全和部分连接的混合模拟数字(HAD)波束形成架构。我们推导了联合距离和角度传感的cram - rao界(CRB),并描述了最大最小通信速率和多目标CRB之间的权衡。为了探索CRB-rate Pareto边界,我们提出了在通信速率约束下的以感知为中心的优化问题。针对全连接HAD体系结构,提出了一种基于惩罚对偶分解(PDD)的双环算法,并采用两阶段方法降低复杂度。这个框架也被扩展到部分连接的情况。仿真结果表明,该方案具有与全数字波束形成器相当的性能,且射频链较少,有效地平衡了硬件效率和系统性能。此外,该方案显著优于空分多址和远场ISAC,提供更低的感知误差和扩展的crb速率区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Cognitive Communications and Networking
IEEE Transactions on Cognitive Communications and Networking Computer Science-Artificial Intelligence
CiteScore
15.50
自引率
7.00%
发文量
108
期刊介绍: The IEEE Transactions on Cognitive Communications and Networking (TCCN) aims to publish high-quality manuscripts that push the boundaries of cognitive communications and networking research. Cognitive, in this context, refers to the application of perception, learning, reasoning, memory, and adaptive approaches in communication system design. The transactions welcome submissions that explore various aspects of cognitive communications and networks, focusing on innovative and holistic approaches to complex system design. Key topics covered include architecture, protocols, cross-layer design, and cognition cycle design for cognitive networks. Additionally, research on machine learning, artificial intelligence, end-to-end and distributed intelligence, software-defined networking, cognitive radios, spectrum sharing, and security and privacy issues in cognitive networks are of interest. The publication also encourages papers addressing novel services and applications enabled by these cognitive concepts.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书