Exploiting Symmetric Non-Convexity for Multi-Objective Symbol-Level DFRC Signal Design
Symbol-level precoding (SLP) is a promising solution for addressing the inherent interference problem in dual-functional radar-communication (DFRC) signal designs. This paper considers an SLP-DFRC signal design problem which optimizes the radar performance under communication performance constraints. We show that a common phase modulation applied to the transmit signals from an antenna array does not affect the performance of different radar sensing metrics, including beampattern similarity, signal-to-interference-plus-noise ratio (SINR), and Cram\'er-Rao lower bound (CRLB). We refer to this as symmetric-rotation invariance, upon which we develop low-complexity yet efficient DFRC signal design algorithms. More specifically, we propose a symmetric non-convexity (SNC)-based DFRC algorithm that relies on the non-convexity of the radar sensing metrics to identify a set of radar-only solutions. Based on these solutions, we further exploit the symmetry property of the radar sensing metrics to efficiently design the DFRC signal. We show that the proposed SNC-based algorithm is versatile in the sense that it can be applied to the DFRC signal optimization of all three sensing metrics mentioned above (beampattern, SINR, and CRLB). In addition, since the radar sensing metrics are independent of the communication channel and data symbols, the set of radar-only solutions can be constructed offline, thereby reducing the computational complexity. We also develop an accelerated SNC-based algorithm that further reduces the complexity. Finally, we numerically demonstrate the superiority of the proposed algorithms compared to existing methods in terms of sensing and communication performance as well as computational requirements.
Code (0)
등록된 구현이 없습니다.
Methods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Disciplined Geodesically Convex Programming
Convex programming plays a fundamental role in machine learning, data science, and engineering. Testing convexity structure in nonlinear programs relies on verifying the convexity of objectives and constraints. \citet{gr…
Online Optimization on Hadamard Manifolds: Curvature Independent Regret Bounds on Horospherically Convex Objectives
We study online Riemannian optimization on Hadamard manifolds under the framework of horospherical convexity (h-convexity). Prior work mostly relies on the geodesic convexity (g-convexity), leading to regret bounds scali…
CoNSoLe: Convex Neural Symbolic Learning
Learning the underlying equation from data is a fundamental problem in many disciplines. Recent advances rely on Neural Networks (NNs) but do not provide theoretical guarantees in obtaining the exact equations owing to t…
Q-LearningDistributed Representations Enable Robust Multi-Timescale Symbolic Computation in Neuromorphic Hardware
Programming recurrent spiking neural networks (RSNNs) to robustly perform multi-timescale computation remains a difficult challenge. To address this, we describe a single-shot weight learning scheme to embed robust multi…
Using Shape Constraints for Improving Symbolic Regression Models
We describe and analyze algorithms for shape-constrained symbolic regression, which allows the inclusion of prior knowledge about the shape of the regression function. This is relevant in many areas of engineering -- in …
regressionSymbolic Regression