Pith. sign in

REVIEW 1 cited by

Cram\'er-Rao Bound Based Waveform Optimization for MIMO Radar: An Efficient Linear-Proximal Method

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 2409.12569 v1 pith:VHS6GPTN submitted 2024-09-19 eess.SP

classification eess.SP
keywords optimizationradarproposedwaveformalgorithmapproachboundcram
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Low-Complexity Cram\'er-Rao Lower Bound and Sum Rate Optimization in ISAC Systems

    cs.IT 2025-02 conditional novelty 5.0 of 10

    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.

Pith tools