🤖 AI Summary
This work addresses the design of 1-bit DAC/ADC massive MIMO dual-function radar-communication (DFRC) systems, aiming to optimize sensing performance while guaranteeing communication quality-of-service under symbol-level constructive interference. The authors enhance angular estimation accuracy for point targets by minimizing the 1-bit Cramér-Rao bound and, for the first time, reveal the non-monotonic dependence of 1-bit Fisher information on signal-to-noise ratio. Leveraging this insight, they introduce amplitude constraints to eliminate suboptimal regions, thereby transforming the original discrete non-convex problem into a continuous constrained optimization problem. An efficient solution is developed by integrating the augmented Lagrangian method, a spectral projected gradient algorithm with non-monotone line search, local search, and cutting-plane techniques. Numerical simulations demonstrate that the proposed approach significantly outperforms existing benchmarks, validating both the theoretical analysis and algorithmic efficacy.
📝 Abstract
In this paper, we investigate the dual-function radar-communication (DFRC) design for massive multiple-input multiple-output (MIMO) systems equipped with 1-bit digital-to-analog converters (DACs) at the transmitter and 1-bit analog-to-digital converters (ADCs) at the receiver, motivated by the need for low-cost and power-efficient implementations of massive MIMO systems. We consider a downlink scenario where the transmit signal matrix is optimized to enhance sensing performance while satisfying communication quality of service (QoS) requirements. Specifically, the objective is to minimize the 1-bit Cramér-Rao bound (CRB) for estimating the azimuth angle of a point-like target under symbol-level constructive interference (CI) constraints. We conduct an asymptotic analysis of the 1-bit Fisher information, revealing its nonmonotonicity with the signal-to-noise ratio (SNR), and introduce amplitude constraints to exclude regions where the objective function value is clearly suboptimal and facilitate convergence to high-quality solutions. The resulting problem is a nonconvex optimization challenge with coupled binary and linear constraints. We transform the discrete problem into a continuous constrained one, characterize its global and local minima, and tackle it via the augmented Lagrangian method (ALM) and a spectral projected gradient (SPG) method combined with nonmonotone line search. The solution is further refined via local search and cutting-plane techniques. Extensive numerical experiments verify our analysis, showing that the proposed approach exhibits promising DFRC performance compared to benchmark schemes.