Computer Science – Information Theory
Scientific paper
2007-11-30
Computer Science
Information Theory
Corrected typos and added references w.r.t. the first version. Paper also published in proc. of IEEE Information Theory Worksh
Scientific paper
We 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 our model. In the discrete memoryless (DM) case, we 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, we also derive lower and upper bounds on channel capacity. The lower bound is obtained by a coding scheme which is based on a combination of codeword splitting and Generalized dirty paper coding. The upper bound is also better than that obtained by assuming that the channel state is available at the source, the relay, and the destination. The two bounds meet, and so give the capacity, in some special cases for the degraded Gaussian case.
Kotagiri Shivaprasad
Laneman Nicholas J.
Vandendorpe Luc
Zaidi Abdellatif
No associations
LandOfFree
Cooperative Relaying with State Available at the Relay does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Cooperative Relaying with State Available at the Relay, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cooperative Relaying with State Available at the Relay will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-702459