On the capacity of large Gaussian relay networks

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 cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is shown that in cases of interest, upper and lower bounds coincide in the limit as the number of relays tends to infinity. Hence, this paper provides a new example where a simple cut-set upper bound is achievable, and one more example where uncoded transmission achieves optimal performance. The findings are illustrated by geometric interpretations.


Published in:
Proceedings of the IEEE International Symposium on Information Theory
Presented at:
IEEE International Symposium on Information Theory, LAUSANNE, SWITZERLAND, Jun 30-Jul 05, 2002
Year:
2005
Publisher:
Institute of Electrical and Electronics Engineers
Keywords:
Laboratories:




 Record created 2011-10-17, last modified 2018-09-13

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)