TY - GEN
T1 - Message and state cooperation in a relay channel when the relay has strictly causal state information
AU - Li, Min
AU - Simeone, Osvaldo
AU - Yener, Aylin
PY - 2011
Y1 - 2011
N2 - A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects source and relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to the source. This exchange enables cooperation between source and relay on both transmission of message and state information to the destination. First, an achievable scheme, inspired by noisy network coding, is proposed that exploits both message and state cooperation. Next, based on the given achievable rate and appropriate upper bounds, capacity results are identified for some special cases. Finally, a Gaussian model is studied, along with corresponding numerical results that illuminate the relative merits of state and message cooperation.
AB - A state-dependent relay channel is studied in which strictly causal channel state information is available at the relay and no state information is available at the source and destination. Source and relay are connected via two unidirectional out-of-band orthogonal links of finite capacity, and a state-dependent memoryless channel connects source and relay, on one side, and the destination, on the other. Via the orthogonal links, the source can convey information about the message to be delivered to the destination to the relay while the relay can forward state information to the source. This exchange enables cooperation between source and relay on both transmission of message and state information to the destination. First, an achievable scheme, inspired by noisy network coding, is proposed that exploits both message and state cooperation. Next, based on the given achievable rate and appropriate upper bounds, capacity results are identified for some special cases. Finally, a Gaussian model is studied, along with corresponding numerical results that illuminate the relative merits of state and message cooperation.
UR - http://www.scopus.com/inward/record.url?scp=79955758325&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79955758325&partnerID=8YFLogxK
U2 - 10.1109/ITA.2011.5743602
DO - 10.1109/ITA.2011.5743602
M3 - Conference contribution
AN - SCOPUS:79955758325
SN - 9781457703614
T3 - 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings
SP - 351
EP - 356
BT - 2011 Information Theory and Applications Workshop, ITA 2011 - Conference Proceedings
T2 - 2011 Information Theory and Applications Workshop, ITA 2011
Y2 - 6 February 2011 through 11 February 2011
ER -