Approximate Capacity of Gaussian Relay Networks
Preprint
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 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.Keywords
All Related Versions
- Version 1, 2008-02-24, ArXiv
- Version 2, 2008-06-06, ArXiv
- Published version: , 474.
This publication has 6 references indexed in Scilit:
- Capacity of a Class of Deterministic Relay Channels2007
- Cooperative strategies and capacity theorems for relay networksIEEE Transactions on Information Theory, 2005
- An Achievable Rate for the Multiple-Level Relay ChannelIEEE Transactions on Information Theory, 2005
- A First Course in Information Theory2002
- Network information flowIEEE Transactions on Information Theory, 2000
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979