Capacity bounds for diamond networks with an orthogonal broadcast channel
SS Bidokhti, G Kramer - IEEE Transactions on Information …, 2016 - ieeexplore.ieee.org
IEEE Transactions on Information Theory, 2016•ieeexplore.ieee.org
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 the 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 …
modeled by two independent bit-pipes. New upper and lower bounds on the capacity are
derived. The proof technique for the upper bound generalizes the 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 …
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 the 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 the ranges of bit-pipe capacities.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果