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 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 …

The cut-set bound developed by Cover and El Gamal in 1979 has since remained the best
known upper bound on the capacity of the Gaussian relay channel. We develop a new …

A general class of wireless relay networks with a single source-destination pair is
considered. Intermediate nodes in the network employ an amplify-and-forward scheme to …

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 …

The capacity of a particular large Gaussian relay network is determined in the limit as the
number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and …

We consider a relay network having K source-destination pairs. Finding the capacity region
of such a network with multiple unicast sessions is in general difficult. By focusing on a …

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 …

It has been shown recently that the overall throughput of dense wireless networks can
increase significantly when wireless nodes collaborate in transmission of different packets …

The Gaussian parallel relay network | IEEE Conference Publication | IEEE Xplore The Gaussian
parallel relay network Abstract: We introduce the real, discrete-time Gaussian parallel relay …