Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2203.14532

Joint Active and Passive Beamforming Design for IRS-Aided Radar-Communication

Meng Hua·Qingqing Wu·Chong He·Shaodan Ma·Wen Chen
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study an intelligent reflecting surface (IRS)-aided radar-communication (Radcom) system, where the IRS is leveraged to help Radcom base station (BS) transmit the joint of communication signals and radar signals for serving communication users and tracking targets simultaneously. The objective of this paper is to minimize the total transmit power at the Radcom BS by jointly optimizing the active beamformers, including communication beamformers and radar beamformers, at the Radcom BS and the phase shifts at the IRS, subject to the minimum signal-to-interference-plus-noise ratio (SINR) required by communication users, the minimum SINR required by the radar, and the cross-correlation pattern design. In particular, we consider two cases, namely, case I and case II, based on the presence or absence of the radar cross-correlation design and the interference introduced by the IRS on the Radcom BS. For case I where the cross correlation design and the interference are not considered, we prove that the dedicated radar signals are not needed, which significantly reduces implementation complexity and simplifies algorithm design. Then, a penalty-based algorithm is proposed to solve the resulting non-convex optimization problem. Whereas for case II considering the cross-correlation design and the interference, we unveil that the dedicated radar signals are needed in general to enhance the system performance. Since the resulting optimization problem is more challenging to solve as compared with the case I, the semidefinite relaxation (SDR) based alternating optimization (AO) algorithm is proposed. Simulation results demonstrate the effectiveness of proposed algorithms and also show the superiority of the proposed scheme over various benchmark schemes.

Explore related subjects

cs.ITeess.SPmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Meng Hua, Qingqing Wu, Chong He, Shaodan Ma, Wen Chen. 2022-03-28. Joint Active and Passive Beamforming Design for IRS-Aided Radar-Communication. https://arxiv.org/abs/2203.14532

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

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT↗
arXiv2026

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT↗
arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗