Integrated Sensing and Communication with Distributed Rate-Limited Helpers
Yiqi Chen, Holger Boche, Tobias J. Oechtering, Mikael Skoglund
TL;DR
This work investigates integrated sensing and communication (ISAC) over a state-dependent channel with two rate-limited helpers: one observing the channel state sequence $S^n$ noncausally and the other observing the feedback sequence $Z^n$, and it derives a capacity–compression–distortion tradeoff region $C(D)$. A novel coding scheme blends a noncausal description of part of the state at block start with a joint compression of the remainder alongside the feedback, yielding a computable inner bound that is tight in several special cases. The main contributions include a general inner bound $\mathcal{R}^{in}(D)$ with a joint distribution over auxiliary variables, multiple specialized bounds for rate-limited vs. rate-unlimited feedback, and a decomposable-channel analysis that reveals a common-component structure and two corner-point regimes. Special cases—such as rate-unlimited feedback with a message-cognizant state encoder and decomposable channels with receiver-side helpers—give exact capacity-distortion regions $C(D)$ or tight outer bounds, providing benchmarks for ISAC system design. Numerical examples illustrate the tradeoffs between state-description quality, communication rate, and distortion, demonstrating how rate-limited helpers can enhance both sensing and communication performance.
Abstract
This paper studies integrated sensing and communication (ISAC) systems with two rate-limited helpers who observe the channel state sequence and the feedback sequence, respectively. Depending on the timing of compressing and using the state information, our proposed coding scheme gives an inner bound of the capacity-compression-distortion tradeoff region. The tradeoff is realized by sending part of the state information at the beginning of the transmission to facilitate the communication and compressing the remaining part together with the feedback signal. The inner bound becomes tight bounds in several special cases.
