We approximate the capacity of the Gaussian parallel relay network with general channel
gains. Our strategy is to find capacity approximations for the corresponding network in the …

Beginning with work by Avestimehr, Diggavi and Tse, there have been a series of papers
showing that the capacity of Gaussian relay networks can be closely approximated by the …

We present an achievable rate for general Gaussian relay networks. We show that the
achievable rate is within a constant number of bits from the information-theoretic cut-set …

We examine the extent to which Gaussian relay networks can be approximated by
deterministic networks, and present two results, one negative and one positive. The gap …

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 …

We determine the asymptotic capacity of a Gaussian multiple-relay channel as the number
of relays tends to infinity. The upper bound is an application of the cut-set theorem, and the …

We consider the Gaussian “diamond” or parallel relay network, in which a source node
transmits a message to a destination node with the help of N relays. Even for the symmetric …

For every Gaussian relay network with a single source-destination pair, it is known that there
exists a corresponding deterministic network called the discrete superposition network that …

Consider a Gaussian relay network where a number of sources communicate to a
destination with the help of several layers of relays. Recent work has shown that a compress …

The capacity or approximations to capacity of various single-source single-destination relay
network models has been characterized in terms of the cut-set upper bound. In principle, a …