Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels
2012 (English)In: IEEE Communications Letters, ISSN 1089-7798, Vol. 16, no 10, 1529-1531 p.Article in journal (Refereed) Published
We investigate memoryless multiple-access relay channels (MARCs) and establish the capacity of two semideterministic classes of such channels: MARCs with orthogonal receive components and state-decoupled MARCs. For both cases, the achievability and converse are proved using the noisy network coding lower bound and the cutset upper bound, respectively. Finally, the capacity of a MARC with additive Gaussian interference is quantified.
Place, publisher, year, edition, pages
2012. Vol. 16, no 10, 1529-1531 p.
Capacity, noisy network coding, multiple-access relay channels, channels with state and additive interference
IdentifiersURN: urn:nbn:se:kth:diva-106149DOI: 10.1109/LCOMM.2012.092112.121289ISI: 000310339100001ScopusID: 2-s2.0-84867872131OAI: oai:DiVA.org:kth-106149DiVA: diva2:572950
FunderICT - The Next Generation