|
|
|
| Capacity of a Class of Semi-deterministic Relay Channel with Orthogonal Components and Channel State |
| Deng Zhi-xiang①③ Wang Bao-yun①② Lang Fei |
①(College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210003, China)
②(National Mobile Communications Research Laboratory, Southeast University, Nanjing 210096, China)
③(College of Internet of Things Engineering, Hohai University, Changzhou 213022, China) |
|
|
|
|
Abstract A class of state-dependent relay channel with orthogonal channels from the source to the relay and from the source and the relay to the destination is studied. The two orthogonal channels are corrupted by a common channel state which is known to both the source and the relay non-causally. Based on superposition coding, cooperative GP (Gel’fand-Pinsker) coding and PDF (Partial-Decode-and-Forward) relaying, the lower bound on the capacity for this channel is established firstly. Then, for the semi-deterministic relay channel with orthogonal components whose receiver output is a deterministic function of the relay input, one of the source inputs and the channel state, the explicit capacity is characterized exactly.
|
|
Received: 27 February 2013
|
|
|
|
Corresponding Authors:
Wang Bao-yun
E-mail: bywang@njupt.edu.cn
|
|
|
|
|
|
|
2013, Vol. 35 
