Name
Abstract | ||
|---|---|---|
A class of diamond networks is studied where the broadcast component is modelled by two independent bit-pipes. New upper and lower bounds are derived on the capacity which improve previous bounds. The upper bound is in the form of a max-min problem, where the maximization is over a coding distribution and the minimization is over an auxiliary channel. The proof technique generalizes bounding techniques of Ozarow for the Gaussian multiple description problem (1981) and Kang and Liu for the Gaussian diamond network (2011). The bounds are evaluated for a Gaussian multiple access channel (MAC) and the binary adder MAC, and the capacity is found for interesting ranges of the bit-pipe capacities. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/ISIT.2014.6875022 | ISIT |
Keywords | DocType | Volume |
adders,multiple access channel,gaussian channels,broadcast channels,gaussian mac,auxiliary channel,ozarow,minimization,max-min problem,gaussian multiple description problem,bounding technique,independent bit pipe capacity,channel coding,capacity bounds,gaussian distribution,maximization,broadcast component,minimax techniques,gaussian diamond network,broadcast communication,lower bounds,channel capacity,coding distribution,diamond network,proof technique,binary adder mac,upper bounds | Journal | abs/1401.6135 |
Citations | PageRank | References |
4 | 0.70 | 2 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| shirin saeedi bidokhti | 1 | 52 | 8.29 |
| Gerhard Kramer | 2 | 445 | 34.21 |