Pith. sign in

REVIEW 2 cited by

Optimal Beamforming for Integrated Sensing and Communication Exploiting Prior Distribution Information: How Many Beams are Needed?

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2503.03560 v4 pith:IKZ274RV submitted 2025-03-05 cs.IT eess.SPmath.IT

Optimal Beamforming for Integrated Sensing and Communication Exploiting Prior Distribution Information: How Many Beams are Needed?

classification cs.IT eess.SPmath.IT
keywords sensingbeamsbeamformingoptimalcommunicationneededboundbounds
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original 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\'er-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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Uplink-Downlink Duality for Beamforming in Integrated Sensing and Communications

    cs.IT 2025-09 unverdicted novelty 7.0

    The paper extends uplink-downlink duality to integrated sensing and communications, equating BCRB minimization to directional power maximization and enabling iterative beamformer optimization under SINR constraints.

  2. Robust Beamforming for MIMO Radar with Imperfect Prior Distribution Information

    cs.IT 2026-04 unverdicted novelty 5.0

    A convex optimization formulation for robust MIMO radar beamforming under bounded PDF uncertainty, obtained via quadratic Taylor approximation of the PCRB and the S-procedure to convert infinite constraints into an LMI.