Computer Science – Information Theory
Scientific paper
2011-02-03
Computer Science
Information Theory
6 pages, 3 figures, to appear in Information Theory and Applications Workshop, February 2011
Scientific paper
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.
Li Min
Simeone Osvaldo
Yener Aylin
No associations
LandOfFree
Message and State Cooperation in a Relay Channel When the Relay Has Strictly Causal State Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Message and State Cooperation in a Relay Channel When the Relay Has Strictly Causal State Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message and State Cooperation in a Relay Channel When the Relay Has Strictly Causal State Information will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-428609