A successive convex approximation plus shifted generalized power iteration algorithm is proposed to maximize the weighted sum of communication rate and negative Cramér-Rao bound in ISAC beamforming.
Cram\'er-Rao Bound Based Waveform Optimization for MIMO Radar: An Efficient Linear-Proximal Method
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
This paper focuses on radar waveform optimization for minimizing the Cram\'er-Rao bound (CRB) in a multiple-input multiple-output (MIMO) radar system. In contrast to conventional approaches relying on semi-definite programming (SDP) and optimization toolboxes like CVX, we introduce a pioneering and efficient waveform optimization approach in this paper. Our proposed algorithm first applies sequential linear approximation to transform the original CRB-based problem with the transmit power constraint into a sequence of convex subproblems. By introducing a proximal term and further leveraging the Karush-Kuhn-Tucker (KKT) conditions, we derive the optimal closed-form solution for each subproblem. The convergence of the proposed algorithm is then proved rigorously. Numerical results demonstrate that the proposed approach significantly reduces computational complexity -- at least two orders of magnitude lower than the baseline algorithms while maintaining the same radar sensing accuracy.
citation-role summary
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Low-Complexity Cram\'er-Rao Lower Bound and Sum Rate Optimization in ISAC Systems
A successive convex approximation plus shifted generalized power iteration algorithm is proposed to maximize the weighted sum of communication rate and negative Cramér-Rao bound in ISAC beamforming.