State-Dependent Relay Channel: Achievable Rate and Capacity of a Semideterministic Class
2013 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 59, no 5, 2629-2638 p.Article in journal (Refereed) Published
This paper considers the problem of communicating over a relay channel with state when noncausal state information is partially available at the nodes. We first establish a lower bound on the achievable rates based on noisy network coding and Gelfand-Pinsker coding, and show that it provides an alternative characterization of a previously known bound. We then introduce the class of state-decoupled relay channels and show that our lower bound is tight for a subclass of semideterministic channels. We also compute the capacity for two specific examples of this subclass-a channel with multiplicative binary fading and a channel with additive Gaussian interference. These examples are not special cases of previous classes of semideterministic relay channels with known capacity.
Place, publisher, year, edition, pages
2013. Vol. 59, no 5, 2629-2638 p.
Capacity, channels with state, compress-and-forward (CF), noisy network coding (NNC), semideterministic relay channels
IdentifiersURN: urn:nbn:se:kth:diva-123111DOI: 10.1109/TIT.2013.2238579ISI: 000318163500006ScopusID: 2-s2.0-84876750219OAI: oai:DiVA.org:kth-123111DiVA: diva2:624781
FunderSwedish Research Council
QC 201306032013-06-032013-06-032013-06-03Bibliographically approved