版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Shanghai Jiao Tong University Department of Electronic Engineering 200240 China University of Macau State Key Laboratory of Internet of Things for Smart City 999078 China Southeast University National Mobile Communications Research Laboratory Frontiers Science Center for Mobile Information Communication and Security Nanjing210096 China Purple Mountain Laboratories Nanjing211111 China ZTE Corporation State Key Laboratory of Mobile Network and Mobile Multimedia Technology Shenzhen518057 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China University of Macau Department of Electrical and Computer Engineering 999078 China
出 版 物:《IEEE Transactions on Communications》 (IEEE Trans Commun)
年 卷 期:2024年
核心收录:
学科分类:0810[工学-信息与通信工程] 0202[经济学-应用经济学] 1202[管理学-工商管理] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0808[工学-电气工程] 08[工学] 0714[理学-统计学(可授理学、经济学学位)] 0701[理学-数学]
主 题:Convex optimization
摘 要:Integrated sensing and communication (ISAC) systems may face a heavy computation burden since the sensory data needs to be further processed. This paper studies a novel system that integrates sensing, communication, and computation, aiming to provide services for different objectives efficiently. This system consists of a multi-antenna multi-functional base station (BS), an edge server, a target, and multiple single-antenna communication users. The BS needs to allocate the available resources to efficiently provide sensing, communication, and computation services. Due to the heavy service burden and limited power budget, the BS can partially offload the tasks to the nearby edge server instead of computing them locally. We consider the estimation of the target response matrix, a general problem in radar sensing, and utilize Cramér-Rao bound (CRB) as the corresponding performance metric. To tackle the non-convex optimization problem, we propose both semidefinite relaxation (SDR)-based alternating optimization and SDR-based successive convex approximation (SCA) algorithms to minimize the CRB of radar sensing while meeting the requirement of communication users and the need for task computing. Furthermore, we demonstrate that the optimal rank-one solutions of both the alternating and SCA algorithms can be directly obtained via the solver or further constructed even when dealing with multiple functionalities. Simulation results show that the proposed algorithms can provide higher target estimation performance than state-of-the-art benchmarks while satisfying the communication and computation constraints. © 1972-2012 IEEE.