Download now Free registration required
The authors consider a three-terminal state-dependent relay channel with the channel state non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals may be equipped with cognition capabilities, i.e., the relay in their setup. In the Discrete Memoryless (DM) case, they establish lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme at the relay that uses a combination of codeword splitting, Gel'fand-Pinsker binning, and decode-and-forward relaying. The upper bound improves upon that obtained by assuming that the channel state is available at the source, the relay, and the destination. For the Gaussian case, they also derive lower and upper bounds on the capacity.
- Format: PDF
- Size: 361.59 KB