Abstract:This paper studies a multi-target multi-user integrated sensing and communication (ISAC) system where a multi-antenna base station (BS) communicates with multiple single-antenna users in the downlink and senses the unknown and random angle information of multiple targets from reflected echo signals and prior distribution information. We focus on a general transmit beamforming structure with both communication beams and dedicated sensing beams, whose design is highly non-trivial as more sensing beams provide more flexibility in multi-target sensing, but introduce extra interference to multi-user communication. We aim to unveil bounds on the minimum number of dedicated sensing beams needed, and devise numerical algorithms that find optimal beamforming solutions with small numbers of sensing beams which yield low algorithmic and implementational complexity. To this end, we first characterize the sensing performance via deriving the periodic posterior Cramér-Rao bound (PCRB) as a lower bound of the mean-cyclic error (MCE). Then, we optimize the beamforming to minimize the maximum periodic PCRB among all targets to ensure fairness, subject to individual rate constraints at multiple users. Despite the non-convexity of this problem, we propose a general construction method for the optimal solution via semi-definite relaxation (SDR), and derive a general bound on the number of dedicated sensing beams needed. Moreover, we unveil the specific structures of the optimal solution in various practical cases, where tighter bounds on the number of sensing beams needed are derived together with lower-complexity algorithms that find the optimal solution with small numbers of sensing beams. Next, we extend the above studies to the beamforming optimization problem for minimizing the sum periodic PCRB among all targets. Numerical results validate our bounds and the effectiveness of our beamforming designs.
From: Jiayi Yao [view email]
[v1]
Wed, 5 Mar 2025 14:46:33 UTC (30,886 KB)
[v2]
Sat, 3 May 2025 14:01:39 UTC (30,886 KB)
[v3]
Sat, 28 Jun 2025 18:17:57 UTC (13,350 KB)
[v4]
Tue, 28 Jul 2026 07:02:49 UTC (12,999 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。