Search arXivSearch

arXiv · 2604.21580

Robust Beamforming for MIMO Radar with Imperfect Prior Distribution Information

Abstract

This paper studies a multiple-input multiple-output (MIMO) radar system for sensing the unknown and random angular location (angle) of a point target, based on the target-reflected echo signals and known prior distribution information about the target's angle specified by a probability density function (PDF). We consider a challenging yet practical scenario where the knowledge of such PDF is imperfect, due to the inaccuracy in PDF acquisition or unpredicted change of target appearance pattern; while the real (actual) PDF is modeled as an unknown perturbed version of the imperfect known PDF bounded by a given uncertainty radius. Such PDF imperfection motivates us to study the robust transmit beamforming design to optimize the worst-case sensing performance among all possible real PDFs. Since the sensing mean-squared error (MSE) is difficult to be characterized explicitly, we adopt the worst-case posterior Cramér-Rao bound (PCRB) as the performance metric. We formulate the beamforming optimization problem to minimize the maximum PCRB among all possible real PDFs, which is highly non-trivial since the PCRB has a complex intractable expression over the real PDF, and there are infinite constraints corresponding to the continuous set of real PDFs bounded by the uncertainty radius. To address these challenges, we derive a tractable quadratic approximation of the PCRB via second-order Taylor expansion, and leverage the S-procedure to equivalently transform the infinite constraints into a linear matrix inequality, based on which the problem is reformulated into a convex optimization problem solvable with polynomial time complexity. The obtained solution approaches the globally optimal robust beamforming solution as the uncertainty radius decreases. Numerical results validate the effectiveness of our proposed robust beamforming design.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yizhuo Wang, Shuowen Zhang. 2026-04-23. Robust Beamforming for MIMO Radar with Imperfect Prior Distribution Information. https://arxiv.org/abs/2604.21580

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

KEEP EXPLORING

Related papers

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

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

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