Abstract
We consider a state-dependent three-terminal full-duplex relay channel with the channel states noncausally available at only the source, that is, neither at the relay nor at the destination. This model has application to cooperation over certain wireless channels with asymmetric cognition capabilities and cognitive interference relay channels. We establish lower bounds on the channel capacity for both discrete memoryless (DM) and Gaussian cases. For the DM case, the coding scheme for the lower bound uses techniques of rate-splitting at the source, decode-and-forward (DF) relaying, and a Gel'fand-Pinsker-like binning scheme. In this coding scheme, the relay decodes only partially the information sent by the source. Due to the rate-splitting, this lower bound is better than the one obtained by assuming that the relay decodes all the information from the source, that is, full-DF. For the Gaussian case, we consider channel models in which each of the relay node and the destination node experiences on its link an additive Gaussian outside interference. We first focus on the case in which the links to the relay and to the destination are corrupted by the same interference; and then we focus on the case of independent interferences. We also discuss a model with correlated interferences. For each of the first two models, we establish a lower bound on the channel capacity. The coding schemes for the lower bounds use techniques of dirty paper coding or carbon copying onto dirty paper, interference reduction at the source and decode-and-forward relaying. The results reveal that, by opposition to carbon copying onto dirty paper and its root Costa's initial dirty paper coding (DPC), it may be beneficial in our setup that the informed source uses a part of its power to partially cancel the effect of the interference so that the uninformed relay benefits from this cancellation, and so the source benefits in turn.
Highlights
In this work, we consider a state-dependent three-terminal full-duplex relay channel (RC) in which the outputs Y2 at the relay and Y3 at the destination are controlled by the channel inputs X1 from the source and X2 from the relay, along with a random parameter S that represents the channel state, through a given conditional probability WY2,Y3|X1,X2,S
We first focus on the model in which the links to the relay and to the destination are corrupted by the same interference. For this model we derive a lower bound on the channel capacity, based on a coding scheme that combines techniques of generalized dirty paper coding (DPC) [11, 13] and partial decode-and-forward relaying
We obtain a lower bound on the channel capacity by using a coding scheme that combines carefully the techniques of carbon copying onto dirty paper (CC) [36], interference reduction at the source, and decode-and-forward relaying
Summary
We consider a state-dependent three-terminal full-duplex relay channel (RC) in which the outputs Y2 at the relay and Y3 at the destination are controlled by the channel inputs X1 from the source and X2 from the relay, along with a random parameter S that represents the channel state, through a given conditional probability WY2,Y3|X1,X2,S. We first focus on the model in which the links to the relay and to the destination are corrupted by the same interference For this model we derive a lower bound on the channel capacity, based on a coding scheme that combines techniques of generalized DPC [11, 13] and partial decode-and-forward relaying. We focus on the case of independent interferences For this case, we obtain a lower bound on the channel capacity by using a coding scheme that combines carefully the techniques of carbon copying onto dirty paper (CC) [36], interference reduction at the source, and decode-and-forward relaying.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: EURASIP Journal on Wireless Communications and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
