Computer Science – Information Theory
Scientific paper
2008-02-24
Computer Science
Information Theory
This paper is submited to 2008 IEEE International Symposium on Information Theory (ISIT 2008) -In the revised format the appro
Scientific paper
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 upper bound on the capacity of these networks. This constant depends on the topology of the network, but not the values of the channel gains. Therefore, we uniformly characterize the capacity of Gaussian relay networks within a constant number of bits, for all channel parameters.
Avestimehr Amir Salman
Diggavi Suhas N.
Tse David N. C.
No associations
LandOfFree
Approximate Capacity of Gaussian Relay Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Approximate Capacity of Gaussian Relay Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximate Capacity of Gaussian Relay Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-427282