Approximate Capacity of Gaussian Relay Networks
Information Theory
2016-11-17 v2 math.IT
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.
Cite
@article{arxiv.0802.3535,
title = {Approximate Capacity of Gaussian Relay Networks},
author = {Amir Salman Avestimehr and Suhas N. Diggavi and David N C. Tse},
journal= {arXiv preprint arXiv:0802.3535},
year = {2016}
}
Comments
This paper is submited to 2008 IEEE International Symposium on Information Theory (ISIT 2008) -In the revised format the approximation gap (\kappa) is sharpened