Asymptotic sum-capacity of random Gaussian interference networks using interference alignment

Asymptotic sum-capacity of random
Gaussian interference networks
using interference alignment

Asymptotic sum-capacity of random Gaussian interference networks using interference alignment
M Aldridge, O Johnson, and R Piechocki
2010 IEEE International Symposium on Information Theory Proceedings, 410-414, 2010
doi:10.1109/ISIT.2010.5513390

Download (PDF, 5 pages)
View on IEEE Xplore
Also available at arXiv:1002.0235v2 [cs.IT]

Abstract

We consider a dense n-user Gaussian interference network formed by paired transmitters and receivers placed independently at random in Euclidean space. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity C_Sigma / n to 1/2 E log(1 + 2SNR). The achievability result follows directly from results based on an interference alignment scheme presented in recent work of Nazer et al. Our main contribution comes through the converse result, motivated by ideas of `bottleneck links' developed in recent work of Jafar. An information theoretic argument gives a capacity bound on such bottleneck links, and probabilistic counting arguments show there are sufficiently many such links to tightly bound the sum-capacity of the whole network.

BibTeX

@INPROCEEDINGS{asymptotic-sum-capacity,
   author={Aldridge, M. and Johnson, O. and Piechocki, R.},
   booktitle={Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on},
   title={Asymptotic sum-capacity of random Gaussian interference networks using interference alignment},
   year={2010},
   month={june},
   pages={410 -414},
   doi={10.1109/ISIT.2010.5513390},
}

Matthew Aldridge