English

A Rate-Distortion Bound for ISAC

Information Theory 2025-10-10 v1 math.IT

Abstract

This paper addresses the fundamental performance limits of Integrated Sensing and Communication (ISAC) systems by introducing a novel converse bound based on rate-distortion theory. This rate-distortion bound (RDB) overcomes the restrictive regularity conditions of classical estimation theory, such as the Bayesian Cram\'er-Rao Bound (BCRB). The proposed framework is broadly applicable, holding for arbitrary parameter distributions and distortion measures, including mean-squared error and probability of error. The bound is proved to be tight in the high sensing noise regime and can be strictly tighter than the BCRB in the low sensing noise regime. The RDB's utility is demonstrated on two challenging scenarios: Nakagami fading channel estimation, where it provides a valid bound even when the BCRB is inapplicable, and a binary occupancy detection task, showcasing its versatility for discrete sensing problems. This work provides a powerful and general tool for characterizing the ultimate performance tradeoffs in ISAC systems.

Keywords

Cite

@article{arxiv.2510.08487,
  title  = {A Rate-Distortion Bound for ISAC},
  author = {Mohammadreza Bakhshizadeh Mohajer and Alex Dytso and Daniela Tuninetti and Luca Barletta},
  journal= {arXiv preprint arXiv:2510.08487},
  year   = {2025}
}

Comments

35 pages, 3 figures, submitted to JSAIT

R2 v1 2026-07-01T06:27:26.160Z