Search arXivSearch

arXiv · 2510.08487

A Rate-Distortion Bound for Integrated Sensing and Communication

Abstract

We develop a general rate--distortion bound (RDB) for the fundamental sensing--communication tradeoff in integrated sensing and communication (ISAC) systems. The RDB lower-bounds the Bayesian sensing risk for arbitrary parameter alphabets, sensing-channel laws, and distortion measures without requiring regularity conditions on the parameter distribution. A key feature is that the distortion--rate function is applied to the sensing information induced by each transmitted signal before averaging. This preserves signal-dependent sensing information and yields a bound that is no weaker, and potentially strictly tighter, than one based only on average sensing information. The RDB is exact in the high-sensing-noise limit and, under scalar squared-error loss, its entropy-power specialization is no looser than the Bayesian Cramér--Rao bound (BCRB). Applications to binary occupancy detection and multiple-input multiple-output (MIMO) Nakagami target-response estimation demonstrate its scope, including discrete sensing and severe fading regimes in which the conventional BCRB yields only the trivial zero lower bound. Covariance-based outer bounds and Gaussian and semi-unitary achievable schemes further reveal how signal randomness and spatial energy allocation shape the tradeoff.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammadreza Bakhshizadeh Mohajer, Alex Dytso, Daniela Tuninetti, Luca Barletta. 2026-09-17. A Rate-Distortion Bound for Integrated Sensing and Communication. https://arxiv.org/abs/2510.08487

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