Search arXivSearch

arXiv · 2511.08326

A General Ziv-Zakai Bound for DoA Estimation in MIMO Radar Systems

Abstract

This paper derives a Ziv-Zakai Bound (ZZB) on the Mean Squared Error (MSE) for Direction-of-Arrival (DoA) estimation in co-located Multiple-Input Multiple-Output (MIMO) radar systems and provides closed-form expressions that hold for multi-target scenarios. Unlike classical results that address single-input multiple-output systems with complex Gaussian input signals, the developed ZZB in this paper explicitly accounts for a general input covariance matrix, target radar cross-section statistics and multiple snapshot effects, and admits a compact expression that reveals the dependence of the MSE on the number of transmit antennas, number of targets, Signal-to-Noise Ratio (SNR) and the transmit covariance matrix. Numerical simulations validate the tightness of the ZZB in the a priori dominated region and show how the increase of the number of transmit antennas compresses the threshold SNR for the transition to the Cramer-Rao bound (CRB) while the variation of the number of targets shifts the bound's behavior across SNR regimes. The analytical results and numerical simulations demonstrate that the ZZB is tighter than the CRB, particularly in the low SNR regime.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammadreza Bakhshizadeh Mohajer, Daniela Tuninetti, Luca Barletta. 2025-11-11. A General Ziv-Zakai Bound for DoA Estimation in MIMO Radar Systems. https://arxiv.org/abs/2511.08326

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