Search arXiv⌕ Search

arXiv · 2306.17493

Cramér-Rao Bound Minimization for IRS-Enabled Multiuser Integrated Sensing and Communications

Abstract

This paper investigates an intelligent reflecting surface (IRS) enabled multiuser integrated sensing and communications (ISAC) system, which consists of one multi-antenna base station (BS), one IRS, multiple single-antenna communication users (CUs), and one target at the non-line-of-sight (NLoS) region of the BS. The IRS is deployed to not only assist the communication from the BS to the CUs, but also enable the BS's NLoS target sensing based on the echo signals from the BS-IRS-target-IRS-BS link. We consider two types of targets, namely the extended and point targets, for which the BS aims to estimate the complete target response matrix and the target direction-of-arrival (DoA) with respect to the IRS, respectively. To provide full degrees of freedom for sensing, we consider that the BS sends dedicated sensing signals in addition to the communication signals. Accordingly, we model two types of CU receivers, namely Type-I and Type-II CU receivers, which do not have and have the capability of canceling the interference from the sensing signals, respectively. Under each setup, we jointly optimize the transmit beamforming at the BS and the reflective beamforming at the IRS to minimize the Cramér-Rao bound (CRB) for target estimation, subject to the minimum signal-to-interference-plus-noise ratio (SINR) constraints at the CUs and the maximum transmit power constraint at the BS. We present efficient algorithms to solve the highly non-convex SINR-constrained CRB minimization problems, by using the techniques of alternating optimization, semi-definite relaxation, and successive convex approximation. Numerical results show that the proposed design achieves lower estimation CRB than other benchmark schemes, and the sensing signal interference cancellation at Type-II CU receivers is beneficial when the number of CUs is greater than one.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xianxin Song, Xiaoqi Qin, Jie Xu, Rui Zhang. 2023-06-30. Cramér-Rao Bound Minimization for IRS-Enabled Multiuser Integrated Sensing and Communications. https://arxiv.org/abs/2306.17493

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Low-Interference N-Continuous OFDM via Optimized Time-Domain Smoothing

A novel basis signal optimization method is proposed for reducing the interference in the N-continuous orthogonal frequency division multiplexing (NC-OFDM) system. Compared to conventional NC-OFDM, the proposed scheme is capable of improving the transmission performance while maintaining an identical sidelobe suppression performance imposed by the linear combination of two groups of basis signals. Our performance results demonstrate that with a low-complexity overhead, the proposed scheme is capable of striking a better trade-off among the bit error rate (BER), complexity, and the sidelobe suppression performance compared to its conventional counterparts.

eess.SP↗

Self-Localizing MIMO Beam Mapping with Continuously Evolving Channel Memory

Machine learning has greatly advanced data-driven channel modeling and resource optimization. However, most existing methods require accurately location-labeled datasets, which are costly to collect and maintain in dynamic environments. This paper develops a self-localizing multiple-input multiple-output (MIMO) beam map framework that constructs a hierarchical wireless memory from highly sparse channel state information (CSI) measurements without explicit location labels. To reduce acquisition and processing overhead, we use beamdomain received signal strength (RSS) as compact inputs and theoretically show that they enable asymptotically unbiased spatial signature estimation. A dual-scale extractor captures intrasnapshot angular dependencies and inter-sample correlations for incomplete observations, and a hybrid temporal encoder is designed to consolidate recent CSI into stable short-term context for physical anchor inference. The inferred anchors spatially index a physically structured radio map embedding that stores long-term channel knowledge, which conditions a diffusion decoder for location-consistent full CSI reconstruction. Such a radio map embedding provides a persistent wireless knowledge representation that can be continuously updated and reused without full CSI acquisition. Experiments show that the proposed framework improves physical-anchor recovery accuracy by over 30% under sparse measurements and achieves more than 20% channel-capacity gain in non-line-of-sight (NLOS) beam tracking over Kalman-filter-based methods.

eess.SP↗

Few-Shot Specific Emitter Identification via Integrated Complex Variational Mode Decomposition and Spatial Attention Transfer

Specific emitter identification (SEI) utilizes passive hardware characteristics to authenticate transmitters, providing a robust physical-layer security solution. However, most deep-learning-based methods rely on extensive data or require prior information, which poses challenges in real-world scenarios with limited labeled data. We propose an integrated complex variational mode decomposition algorithm that decomposes and reconstructs complex-valued signals to approximate the original transmitted signals, thereby enabling more accurate feature extraction. We further utilize a temporal convolutional network to effectively model the sequential signal characteristics, and introduce a spatial attention mechanism to adaptively weight informative signal segments, significantly enhancing identification performance. Additionally, the branch network allows leveraging pre-trained weights from other data while reducing the need for auxiliary datasets. Ablation experiments on the simulated data demonstrate the effectiveness of each component of the model. An accuracy comparison on a public dataset reveals that our method achieves 96% accuracy using only 10 symbols without requiring any prior knowledge.

eess.SP↗