A Rate-Distortion Bound for ISAC
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914084349280256 |
|---|---|
| author | Mohajer, Mohammadreza Bakhshizadeh Dytso, Alex Tuninetti, Daniela Barletta, Luca |
| author_facet | Mohajer, Mohammadreza Bakhshizadeh Dytso, Alex Tuninetti, Daniela Barletta, Luca |
| contents | 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ér-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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_08487 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Rate-Distortion Bound for ISAC Mohajer, Mohammadreza Bakhshizadeh Dytso, Alex Tuninetti, Daniela Barletta, Luca Information Theory 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ér-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. |
| title | A Rate-Distortion Bound for ISAC |
| topic | Information Theory |
| url | https://arxiv.org/abs/2510.08487 |