Interference alignment-based sum capacity bounds for random dense Gaussian interference networks

OT Johnson, MP Aldridge, RJ Piechocki

Research output: Contribution to journalArticle (Academic Journal)peer-review

6 Citations (Scopus)

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.
Translated title of the contributionInterference alignment-based sum capacity bounds for random dense Gaussian interference networks
Original languageEnglish
Pages (from-to)282 - 290
Number of pages9
JournalIEEE Transactions on Information Theory
Volume57
Issue number1
DOIs
Publication statusPublished - Jan 2011

Bibliographical note

Publisher: IEEE

Fingerprint Dive into the research topics of 'Interference alignment-based sum capacity bounds for random dense Gaussian interference networks'. Together they form a unique fingerprint.

Cite this