Dissemin is shutting down on January 1st, 2025

Published in

Institute of Electrical and Electronics Engineers, IEEE Transactions on Information Theory, 1(57), p. 282-290, 2011

DOI: 10.1109/tit.2010.2090242

Links

Tools

Export citation

Search in Google Scholar

Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks

Journal article published in 2011 by Oliver Johnson, Matthew Aldridge, Robert Piechocki ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

We consider a dense K user Gaussian interference network formed by paired transmitters and receivers placed independently at random in a fixed spatial region. Under natural conditions on the node position distributions and signal attenuation, we prove convergence in probability of the average per-user capacity CΣ/K to 1/2E 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 an upper bound, motivated by ideas of "bottleneck capacity" developed in recent work of Jafar. By controlling the physical location of transmitter-receiver pairs, we can match a large proportion of these pairs to form so-called ε-bottleneck links, with consequent control of the sum capacity.