Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source

Abdellatif Zaidi (1) , Shlomo Shamai (2) , Pablo Piantanida (3) , Luc Vandendorpe (4)

1 LIGM - Laboratoire d'Informatique Gaspard-Monge
2 EE-Technion - Department of Electrical Engineering - Technion [Haïfa]
3 E3S - Supélec Sciences des Systèmes
4 ICTEAM - Institute of Information and Communication Technologies, Electronics and Applied Mathematics

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal transmission involving cognitive and non-cognitive radios. We study the capacity of this communication model. One principal problem in this setup is caused by the relay's not knowing the channel state. In the discrete memoryless (DM) case, we establish lower bounds on channel capacity. For the Gaussian case, we derive lower and upper bounds on the channel capacity. The upper bound is strictly better than the cut-set upper bound. We show that one of the developed lower bounds comes close to the upper bound, asymptotically, for certain ranges of rates.

Domaines: Théorie de l'information et codage [math.IT]; Théorie de l'information [cs.IT]

Abdellatif Zaidi, Shlomo Shamai, Pablo Piantanida, Luc Vandendorpe. Bounds on the Capacity of the Relay Channel with Noncausal State Information at Source. 2010 IEEE International Symposium on Information Theory (ISIT 2010), Jun 2010, Austin, Texas, United States. pp.639-643, ⟨10.1109/ISIT.2010.5513564⟩. ⟨hal-00793718⟩