Capacity bounds for a class of diamond networks

Saeedi Bidokhti Shirin, Gerhard Kramer

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

8 Zitate (Scopus)

Abstract

A class of diamond networks is studied where the broadcast component is modelled by two independent bit-pipes. New upper and lower bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min problem, where the maximization is over a coding distribution and the minimization is over an auxiliary channel. The proof technique generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). The bounds are evaluated for a Gaussian multiple access channel (MAC) and the binary adder MAC, and the capacity is found for interesting ranges of the bit-pipe capacities.

OriginalspracheEnglisch
Titel2014 IEEE International Symposium on Information Theory, ISIT 2014
Herausgeber (Verlag)Institute of Electrical and Electronics Engineers Inc.
Seiten1196-1200
Seitenumfang5
ISBN (Print)9781479951864
DOIs
PublikationsstatusVeröffentlicht - 2014
Veranstaltung2014 IEEE International Symposium on Information Theory, ISIT 2014 - Honolulu, HI, USA/Vereinigte Staaten
Dauer: 29 Juni 20144 Juli 2014

Publikationsreihe

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Konferenz

Konferenz2014 IEEE International Symposium on Information Theory, ISIT 2014
Land/GebietUSA/Vereinigte Staaten
OrtHonolulu, HI
Zeitraum29/06/144/07/14

Fingerprint

Untersuchen Sie die Forschungsthemen von „Capacity bounds for a class of diamond networks“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren