TY - GEN
T1 - Capacity of two-relay diamond networks with rate-limited links to the relays and a binary adder multiple access channel
AU - Bidokhti, Shirin Saeedi
AU - Kramer, Gerhard
N1 - Publisher Copyright:
© 2016 IEEE.
PY - 2016/8/10
Y1 - 2016/8/10
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84985911614&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2016.7541582
DO - 10.1109/ISIT.2016.7541582
M3 - Conference contribution
AN - SCOPUS:84985911614
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 1665
EP - 1669
BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 IEEE International Symposium on Information Theory, ISIT 2016
Y2 - 10 July 2016 through 15 July 2016
ER -