Achieving the Capacity of the -Relay Gaussian Diamond Network Within log Bits
B Chern, A Özgür - IEEE Transactions on Information Theory, 2014 - ieeexplore.ieee.org
We consider the-relay Gaussian diamond network where a source node communicates to a
destination node via parallel relays through a cascade of a Gaussian broadcast (BC) and a …
destination node via parallel relays through a cascade of a Gaussian broadcast (BC) and a …
Wireless network simplification: The Gaussian N-relay diamond network
We consider the Gaussian N-relay diamond network, where a source wants to communicate
to destination node through a layer of N-relay nodes. We investigate the following question …
to destination node through a layer of N-relay nodes. We investigate the following question …
Gaussian half-duplex relay networks: Improved constant gap and connections with the assignment problem
This paper considers a Gaussian relay network where a source transmits a message to a
destination with the help of N half-duplex relays. The information theoretic cut-set upper …
destination with the help of N half-duplex relays. The information theoretic cut-set upper …
Gaussian 1-2-1 networks: Capacity results for mmwave communications
This paper proposes a new model for wireless relay networks referred to as “1-2-1 network”,
where two nodes can communicate only if they point “beams” at each other, otherwise no …
where two nodes can communicate only if they point “beams” at each other, otherwise no …
An approximation approach to network information theory
This monograph illustrates a novel approach, which is based on changing the focus to seek
approximate solutions accompanied by universal guarantees on the gap to optimality, in …
approximate solutions accompanied by universal guarantees on the gap to optimality, in …
Capacity approximations for Gaussian relay networks
Consider a Gaussian relay network where a source node communicates to a destination
node with the help of several layers of relays. Recent work has shown that compress-and …
node with the help of several layers of relays. Recent work has shown that compress-and …
On the optimality of simple schedules for networks with multiple half-duplex relays
This paper studies networks that consist of N half-duplex relays assisting the communication
between a source and a destination. In ISIT'12 Brahma et al. conjectured that in Gaussian …
between a source and a destination. In ISIT'12 Brahma et al. conjectured that in Gaussian …
Capacity bounds for diamond networks with an orthogonal broadcast channel
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 …
modeled by two independent bit-pipes. New upper and lower bounds on the capacity are …
Approximately achieving Gaussian relay network capacity with lattice-based QMF codes
Recently, a new relaying strategy, quantize-map-and-forward (QMF) scheme, has been
demonstrated to approximately achieve (within an additive constant number of bits) the …
demonstrated to approximately achieve (within an additive constant number of bits) the …
Network simplification in half-duplex: Building on submodularity
This paper explores the network simplification problem in the context of Gaussian half-
duplex diamond networks. Specifically, given an N-relay diamond network, this problem …
duplex diamond networks. Specifically, given an N-relay diamond network, this problem …