4.7 Article

Cramer-Rao Bound Optimization for Joint Radar-Communication Beamforming

Journal

IEEE TRANSACTIONS ON SIGNAL PROCESSING
Volume 70, Issue -, Pages 240-253

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2021.3135692

Keywords

Radar; Array signal processing; Sensors; Radar antennas; Estimation; Optimization; Receiving antennas; Dual-functional radar-communication; joint beamforming; Cramer-Rao bound; semidefinite relaxation; successive convex approximation

Funding

  1. National Natural Science Foundation of China [62101234, 62101422, 12022116]
  2. Engineering and Physical Sciences Research Council [EP/S028455/1]
  3. China Academy of Information and Communications Technology [CG20210717002]
  4. EPSRC [EP/S028455/1] Funding Source: UKRI

Ask authors/readers for more resources

This paper proposes a MIMO beamforming design for joint radar sensing and multi-user communications. By minimizing the Cramer-Rao bound (CRB) of radar sensing while guaranteeing a pre-defined SINR level for each communication user, the target estimation performance is improved. Closed form optimal solutions are derived for both point and extended targets in the single-user scenario. For the multi-user scenario, both problems are relaxed into semidefinite programming, and the global optimum can be generally obtained.
In this paper, we propose multi-input multi-output (MIMO) beamforming designs towards joint radar sensing and multi-user communications. We employ the Cramer-Rao bound (CRB) as a performance metric of target estimation, under both point and extended target scenarios. We then propose minimizing the CRB of radar sensing while guaranteeing a pre-defined level of signal-to-interference-plus-noise ratio (SINR) for each communication user. For the single-user scenario, we derive a closed form for the optimal solution for both cases of point and extended targets. For the multi-user scenario, we show that both problems can be relaxed into semidefinite programming by using the semidefinite relaxation approach, and prove that the global optimum can be generally obtained. Finally, we demonstrate numerically that the globally optimal solutions are reachable via the proposed methods, which provide significant gains in target estimation performance over state-of-the-art benchmarks.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available