Joint Optimization of Radar and Communications Performance in 6G Cellular Systems

Dual functional radar communication (DFRC) is a promising approach that provides a viable solution for the problem of spectrum sharing between communication and radar applications. This paper studies a DFRC system with multiple communication users (CUs) and a radar target. The goal is to devise beam...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on green communications and networking Vol. 7; no. 1; p. 1
Main Authors: Ashraf, Mateen, Tan, Bo, Moltchanov, Dmitri, Thompson, John S., Valkama, Mikko
Format: Journal Article
Language:English
Published: Piscataway IEEE 01.03.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:2473-2400, 2473-2400
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Dual functional radar communication (DFRC) is a promising approach that provides a viable solution for the problem of spectrum sharing between communication and radar applications. This paper studies a DFRC system with multiple communication users (CUs) and a radar target. The goal is to devise beamforming vectors at the DFRC transmitter in such a way that the radar received signal-to-clutter-plus-noise-ratio (SCNR) is maximized while satisfying the minimum data rate requirements of the individual CUs. With regard to clutter, we consider two scenarios based on the possibility of clutter removal. Even though the formulated optimization problems are non-convex, we present efficient algorithms to solve them using convex optimization techniques. Specifically, we use duality theory and Karush-Kuhn-Tucker conditions to show the underlying structure of optimal transmit precoders. In the proposed solution, it is observed that there is no need to transmit separate probing signal for the radar detection in both the considered scenarios. This results in reduction in the number of optimization variables in the problem. Moreover, we make use of the asymptotic equivalence between Toeplitz matrices and Circulant matrices to further reduce the complexity of the proposed algorithm. Finally, numerical results are presented to demonstrate the effectiveness of the proposed algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2473-2400
2473-2400
DOI:10.1109/TGCN.2023.3234258