CORTEXA
← Browse
arxivcs.ITeess.SP2026-07-03

Cramér-Rao Bound Optimization for Massive MIMO DFRC Systems with 1-Bit DACs and ADCs

Chenfei Huang, Mingjie Shao, Ya-Feng Liu

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.

View free PDFSource page

Related papers

arxivcs.ITeess.SP2026-07-07

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals

Junren Chen, Arya Mazumdar, Ming Yuan

This paper provides the first near-optimal lower bounds for one-bit compressed sensing of approximately sparse signals lying in a scaled $\ell_1$ ball, which is a commonly adopted relaxation of the exactly $k$-sparse assumption. In prior works, the best known upper bounds on unif…

View free PDFSource page
arxiveess.SPcs.IT2026-07-21

Non-Square UPA-Enabled XL-MIMO Systems: Anisotropic Near-Field Characterization, Fundamental Limits, and Channel Estimation

Yilong Liu, Xi Yang, Jing Xu, Jun Zhang, Shi jin

Extremely large-scale multiple-input multiple-output (XL-MIMO) is crucial for next-generation communication systems. In practice, the deployment of non-square uniform planar arrays (UPAs) fundamentally alters wavefront characteristics and induces anisotropic beamfocusing capabili…

View free PDFSource page
arxivcs.ITeess.SP2026-07-20

Task-Oriented Precoding for Edge Inference over Large-Scale MIMO Systems

Hongru Li, Zeyan Zhuang, Zixin Wang, Hengtao He, Shenghui Song, Jun Zhang, et al.

Future wireless networks are expected to support networked artificial intelligence (AI) services, where multiple devices transmit learned features to an edge server for distributed inference. This setting calls for task-oriented physical-layer optimization, where wireless transmi…

View free PDFSource page
arxiveess.SPcs.IT2026-07-21

Low-Complexity Channel Estimation Framework for Non-Square UPA-Assisted XL-MIMO Systems

Yilong Liu, Xi Yang, Binggui Zhou, Yu Han, Ting Liu, Shaodan Ma

Low-complexity channel state information acquisition is crucial for extremely large-scale multiple-input multiple-output (XL-MIMO) systems. However, practical deployments of non-square uniform planar arrays (UPAs) in hybrid-field environments face prohibitive computational comple…

View free PDFSource page