Capacity of two-relay diamond networks with rate-limited links to the relays and a binary adder multiple access channel
SS Bidokhti, G Kramer - 2016 IEEE international symposium on …, 2016 - ieeexplore.ieee.org
2016 IEEE international symposium on information theory (ISIT), 2016•ieeexplore.ieee.org
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.
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.
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果