Capacity Bounds for Diamond Networks With an Orthogonal Broadcast Channel

DOI10.1109/TIT.2016.2609388MaRDI QIDQ2976431zbMATH OpenOpenAlexFDO

Authors Shirin Saeedi Bidokhti, Gerhard Kramer

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1510.00994

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). The lower bound is based on Marton's coding technique and superposition coding. The bounds are evaluated for Gaussian and binary adder multiple access channels (MACs). For Gaussian MACs, both the lower and upper bounds strengthen the Kang-Liu bounds and establish capacity for interesting ranges of bit-pipe capacities. For binary adder MACs, the capacity is established for all ranges of bit-pipe capacities.

Cited in

(2)

• Broadcast diamond channel: transmission strategies and bounds
• The Approximate Capacity of the Gaussian N-Relay Diamond Network

This page was built for publication: Capacity Bounds for Diamond Networks With an Orthogonal Broadcast Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976431)