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 …

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 …

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 evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF)
relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian …

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 …

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

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 …

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 …

We consider a Gaussian diamond network where a source communicates with the
destination through n noninterfering half-duplex relays. Using simple approximations to the …