K-User Fading Interference Channels: The Ergodic Very Strong Case

2009/10/26 by Lalitha Sankar, Jan Vondrak, Sankar, Lalitha +3
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT

paper · pdf · doi:10.48550/arxiv.0910.4874

Presented at the Forty-Seventh Annual Allerton Conference on Communication, Control, and Computing, Sep. 2009

arxiv created 2009/10/26 · arxiv updated 2009/12/01

Abstract

Sufficient conditions required to achieve the interference-free capacity region of ergodic fading K-user interference channels (IFCs) are obtained. In particular, this capacity region is shown to be achieved when every receiver decodes all K transmitted messages such that the channel statistics and the waterfilling power policies for all K (interference-free) links satisfy a set of K(K-1) ergodic very strong conditions. The result is also of independent interest in combinatorics.

Related

• Ergodic Interference Alignment
• Capacity of Symmetric K-User Gaussian Very Strong Interference Channels
• Ergodic Fading One-sided Interference Channels without State Information at Transmitters
• The Capacity Region of the Wireless Ergodic Fading Interference Channel with Partial CSIT to Within One Bit
• On the Capacity of the K-User Cyclic Gaussian Interference Channel