Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TIT.2016.2609388 | IEEE Trans. Information Theory |
Keywords | DocType | Volume |
Relays,Upper bound,Diamond,Encoding,Adders,Entropy,Decoding | Journal | abs/1510.00994 |
Issue | ISSN | Citations |
12 | 0018-9448 | 4 |
PageRank | References | Authors |
0.44 | 20 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| shirin saeedi bidokhti | 1 | 52 | 8.29 |
| Gerhard Kramer | 2 | 445 | 34.21 |