Capacity of Two Semideterministic Classes of Multiple-Access Relay Channels

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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2012-10, Vol.16 (10), p.1529-1531
Hauptverfasser:	Khormuji, Majid Nasiri, Skoglund, M.
Format:	Artikel
Sprache:	eng
Schlagworte:	Additives Applied sciences Capacity Channel models Channels channels with state and additive interference Coding Encoding Exact sciences and technology Gaussian Interference Lower bounds multiple-access relay channels Network coding Networks Noise measurement noisy network coding Relay Relays Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Upper bounds
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	1089-7798 1558-2558 1558-2558
DOI:	10.1109/LCOMM.2012.092112.121289