Cooperative Relaying With State Available at the Relay

Download Now Free registration required

Executive Summary

The authors consider a state-dependent full-duplex relay channel with the state of the channel non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals can be equipped with cognition capabilities, i.e, the relay in their model. In the Discrete Memoryless (DM) case, they derive lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that consists in a combination of codeword splitting, Gel'fand-Pinsker binning, and a decode-and-forward scheme. The upper bound is better than that obtained by assuming that the channel state is available at the source and the destination as well. For the Gaussian case, they also derive lower and upper bounds on channel capacity.

  • Format: PDF
  • Size: 186.28 KB