The Ergodic Capacity of Phase-Fading Interference Networks

DOI10.1109/TIT.2011.2169110zbMATH Open1365.94146arXiv0902.0838OpenAlexW3104606015MaRDI QIDQ5272193

Publication date: 12 July 2017

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

Abstract: We identify the role of equal strength interference links as bottlenecks on the ergodic sum capacity of a

K

user phase-fading interference network, i.e., an interference network where the fading process is restricted primarily to independent and uniform phase variations while the channel magnitudes are held fixed across time. It is shown that even though there are

K (K - 1)

cross-links, only about

K / 2

disjoint and equal strength interference links suffice to determine the capacity of the network regardless of the strengths of the rest of the cross channels. This scenario is called a emph{minimal bottleneck state}. It is shown that ergodic interference alignment is capacity optimal for a network in a minimal bottleneck state. The results are applied to large networks. It is shown that large networks are close to bottleneck states with a high probability, so that ergodic interference alignment is close to optimal for large networks. Limitations of the notion of bottleneck states are also highlighted for channels where both the phase and the magnitudes vary with time. It is shown through an example that for these channels, joint coding across different bottleneck states makes it possible to circumvent the capacity bottlenecks.

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

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Measures of information, entropy (94A17)