Capacity of Two-Relay Diamond Networks with Rate-Limited Links to the Relays and a Binary Adder Multiple Access Channel

摘要

A class of two-relay diamond networks is studied where the broadcast component is modelled by two independent bit-pipes and the multiple-access component is memoryless. A new upper is derived on the capacity which generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). For binary adder MACs, the upper bound establishes the capacity for all ranges of bit-pipe capacities.