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

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

2009-07-29

arxiv.org/abs/0907.5165v1

IEEE Transactions on Information Theory, 57:1, 282-290, 2011

Computer Science

Information Theory

23 pages

Scientific paper

10.1109/TIT.2010.2090242

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 $\half \ep \log(1 + 2 \SNR)$. 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.

Affiliated with

Also associated with

No associations

Rating

Interference alignment-based sum capacity bounds for random dense Gaussian interference networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Interference alignment-based sum capacity bounds for random dense Gaussian interference networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Interference alignment-based sum capacity bounds for random dense Gaussian interference networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-522039