Capacity of a class of relay channel with orthogonal components and non-causal channel state

In this paper, 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 common channel state which is known to both the source and the relay non-causally. The lower bound on the capacity for the channel is derived firstly. Then, we show that if the receiver output Y is a deterministic function of the relay input Xr, the channel state S and one of the source inputs XD, i.e. Y = f(Xr, XD, S), the explicit capacity can be characterized.

[1]  Pravin Varaiya,et al.  Capacity of fading channels with channel side information , 1997, IEEE Trans. Inf. Theory.

[2]  Shlomo Shamai,et al.  On the capacity of a class of relay channels with orthogonal components and noncausal state information at source , 2010, IEEE 5th International Symposium on Wireless Pervasive Computing 2010.

[3]  Claude E. Shannon,et al.  Channels with Side Information at the Transmitter , 1958, IBM J. Res. Dev..

[4]  Yossef Steinberg,et al.  The multiple-access channel with partial state information at the encoders , 2005, IEEE Transactions on Information Theory.

[5]  Shlomo Shamai,et al.  Relay Channel with Orthogonal Components and Structured Interference Known at the Source , 2013, IEEE Transactions on Communications.

[6]  Amos Lapidoth,et al.  Dirty-Paper Coding for the Gaussian Multiaccess Channel With Conferencing , 2012, IEEE Transactions on Information Theory.

[7]  Luc Vandendorpe,et al.  Cooperative Relaying With State Available Noncausally at the Relay , 2009, IEEE Transactions on Information Theory.

[8]  Young-Han Kim.  Capacity of a Class of Deterministic Relay Channels , 2008, IEEE Trans. Inf. Theory.

[9]  Luc Vandendorpe,et al.  Lower Bounds on the Capacity of the Relay Channel with States at the Source , 2008, EURASIP J. Wirel. Commun. Netw..

[10]  Thomas M. Cover,et al.  Network Information Theory , 2001 .

[11]  Young-Han Kim,et al.  Multiple user writing on dirty paper , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[12]  Abbas El Gamal,et al.  Capacity theorems for the relay channel , 1979, IEEE Trans. Inf. Theory.

[13]  Neri Merhav,et al.  Channel Coding in the Presence of Side Information , 2008, Found. Trends Commun. Inf. Theory.

[14]  Max H. M. Costa,et al.  Writing on dirty paper , 1983, IEEE Trans. Inf. Theory.

[15]  J. Nicholas Laneman,et al.  Multiaccess Channels with State Known to Some Encoders and Independent Messages , 2008, EURASIP J. Wirel. Commun. Netw..

[16]  Shlomo Shamai,et al.  Cooperative Multiple-Access Encoding With States Available at One Transmitter , 2008, IEEE Transactions on Information Theory.

[17]  Tetsunao Matsuta,et al.  国際会議開催報告:2013 IEEE International Symposium on Information Theory , 2013 .

[18]  Abbas El Gamal,et al.  Capacity of a class of relay channels with orthogonal components , 2005, IEEE Transactions on Information Theory.

[19]  Yossef Steinberg,et al.  Coding for the degraded broadcast channel with random parameters, with causal and noncausal side information , 2005, IEEE Transactions on Information Theory.

[20]  Fady Alajaji,et al.  On the capacity of memoryless finite-state multiple access channels with asymmetric noisy state information at the encoders , 2011, 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[21]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[22]  Shlomo Shamai,et al.  Bounds on the Capacity of the Relay Channel With Noncausal State at the Source , 2011, IEEE Transactions on Information Theory.

[23]  Abbas El Gamal,et al.  Capacity of a Class of Relay Channels , 2005 .

[24]  Luc Vandendorpe,et al.  Rate Regions for the Partially-Cooperative Relay Broadcast Channel with Non-causal Side Information , 2007, 2007 IEEE International Symposium on Information Theory.