We consider a communication problem where the sender has access to the channel state information and wishes to send both the message information and the state information across the channel. The novelty in characterizing the tradeoff between the message information rate and state estimation error arises primarily because of the inability to encode and decode the state information. The tradeoff region is typically difficult to obtain even for a simple channel. In this work, we characterize the optimal trade-off for the binary channel Yn = Xn ⊕ Sn ⊕ Zn, where Sn is available at the transmitter. We also prove the optimality of the extreme points of the conjectured tradeoff region for the additive Gaussian channel Yn = Xn + Sn + Zn, with Sn i.i.d ∼ N(0, Q) known at the encoder and unknown noise Zn i.i.d ∼ N(0, N).
|Original language||English (US)|
|Number of pages||1|
|Journal||IEEE International Symposium on Information Theory - Proceedings|
|State||Published - Sep 12 2001|
All Science Journal Classification (ASJC) codes
- Electrical and Electronic Engineering