Results 1  10
of
329,624
Approximate Capacity of Gaussian Relay Networks
 IEEE International Symposium on Information Theory
, 2008
"... Abstract—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 informationtheoretic cutset upper bound on the capacity of these networks. This constant depends on the topology of the network, but not the val ..."
Abstract

Cited by 44 (11 self)
 Add to MetaCart
Abstract—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 informationtheoretic cutset upper bound on the capacity of these networks. This constant depends on the topology of the network
On the capacity of large Gaussian relay networks
 IEEE TRANS. INF. THEORY
, 2005
"... 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 cutset arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper and ..."
Abstract

Cited by 149 (6 self)
 Add to MetaCart
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 cutset arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper
On approximating Gaussian relay networks by deterministic networks
 SUBMITTED TO ITW 2009, TAORMINA
, 2009
"... 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 between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons ..."
Abstract
 Add to MetaCart
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 between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons
On approximating Gaussian relay networks with deterministic networks
, 904
"... Abstract — 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 between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The k ..."
Abstract
 Add to MetaCart
Abstract — 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 between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded
On Maximizing Coverage in Gaussian Relay Networks
, 802
"... Abstract—Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how ..."
Abstract
 Add to MetaCart
Abstract—Results for Gaussian relay channels typically focus on maximizing transmission rates for given locations of the source, relay and destination. We introduce an alternative perspective, where the objective is maximizing coverage for a given rate. The new objective captures the problem of how
1Capacity 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 compressandforward based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize their receiv ..."
Abstract
 Add to MetaCart
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 compressandforward based strategies can achieve the capacity of this network within an additive gap. Here, the relays quantize
Improved capacity approximations for gaussian relay networks
 in IEEE Information Theory Workshop (ITW) Seville
, 2013
"... Abstract—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 compressandforward based strategy at the relays can achieve the capacity of this network within an additive gap. In this strateg ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract—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 compressandforward based strategy at the relays can achieve the capacity of this network within an additive gap
Approximate characterization of capacity in Gaussian relay networks
 in Wireless Communications and Mobile Computing Conference (IWCMC
, 2008
"... Abstract—One of the distinguishing features of wireless communication is its broadcast nature. This creates complicated signal interactions when there are multiple transmitting and receiving nodes, due to superposition of signals at the receivers. In this paper, we focus on wireless relay networks w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. Using insights from the analysis of deterministic networks, we develop an approximate characterization for noisy Gaussian relay networks showing that the achievable rate is within a constant number of bits from the informationtheoretic cutset upper bound on the capacity of these networks. This constant
Nested lattice codes for Gaussian relay networks with interference
 IEEE Trans. Inf. Theory
, 2011
"... ar ..."
LowComplexity NearOptimal Codes for Gaussian Relay Networks
"... Abstract—We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr et al. [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However, our proposed codes are also computationally tractable. Our ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract—We consider the problem of information flow over Gaussian relay networks. Similar to the recent work by Avestimehr et al. [1], we propose network codes that achieve up to a constant gap from the capacity of such networks. However, our proposed codes are also computationally tractable. Our
Results 1  10
of
329,624