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

DOI10.1109/TIT.2010.2090242zbMATH Open1366.94374DBLPjournals/tit/JohnsonAP11arXiv0907.5165OpenAlexW3102116220WikidataQ60522088 ScholiaQ60522088MaRDI QIDQ5281126FDOQ5281126

Authors: Oliver Johnson, Matthew Aldridge, Robert J. Piechocki 

Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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 $csum/K$ to $halfeplog(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 $epsilon$-bottleneck links, with consequent control of the sum capacity.

Full work available at URL: https://arxiv.org/abs/0907.5165

Mathematics Subject Classification ID

Channel models (including quantum) in information and communication theory (94A40)

Cited In (1)

• Sum-GDoF of Symmetric Multi-Hop Interference Channel Under Finite Precision CSIT Using Aligned-Images Sum-Set Inequalities

This page was built for publication: Interference Alignment-Based Sum Capacity Bounds for Random Dense Gaussian Interference Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281126)