Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Lower Bounds on the Capacity of the Relay Channel with States at the Source | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2009 Article ID 634296 22 pages doi 2009 634296 Research Article Lower Bounds on the Capacity of the Relay Channel with States at the Source Abdellatif Zaidi and Luc Vandendorpe Ecole Polytechnique de Louvain Universite Catholique de Louvain Louvain La Neuve 1348 Belgium Correspondence should be addressed to Abdellatif Zaidi Received 26 September 2008 Revised 2 February 2009 Accepted 25 June 2009 Recommended by Michael Gastpar 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 fuU-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 .
