Channel communication method enables joint message sending and state sensing

Joint Identification, Transmission, and Sensing over State-Dependent Channels with Noiseless Feedback

Information Theory

Summary

This paper studies how a transmitter can send messages and identify information while also guessing unknown channel conditions, all at once. The authors show how to find the best balance between sending information and sensing the channel without extra noise. They provide formulas that describe how much information can be sent and identified while keeping sensing accurate. Their approach cleverly combines several coding techniques and proves these rates are optimal given the constraints.

What this means in practice

  • For network protocol designers: Design communication protocols that integrate message transmission with real-time channel state estimation to optimize system performance under feedback constraints.
  • For wireless system engineers: Develop channel coding schemes that jointly encode data and sensing tasks for improved efficiency and reliability in wireless communication systems with feedback.

A theory result. No direct application yet.

Authors

Vida Gholamian, Marcel A. Mross, Roberto Ferrara, Eduard A. Jorswieck, Christian Deppe

Abstract

We consider a discrete memoryless state-dependent channel with noiseless feedback, where the transmitter uses randomized encoding to jointly perform message transmission, identification, and state sensing. In this setting, the transmitter sends a conventional transmission message and an identification message while estimating the unknown channel state sequence under an average distortion constraint. We establish a single-letter characterization of the randomized identification-transmission-sensing capacity-distortion region. The result reveals a single-letter separation structure: the communication rates are determined by the averaged channel, subject to the sensing-induced constraint on admissible input distributions. Specifically, the transmission rate is characterized by mutual information, while the identification rate is characterized by output entropy under the same distortion constraint. The achievability proof combines constant-composition transmission coding, output partitioning, and combinatorial identification coding, while the converse follows from an averaged-channel reduction, distortion lower bounds, and feedback-identification converse arguments.