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

TL;DR

This paper establishes conditions under which the capacity region of ergodic fading K-user interference channels can be achieved by all receivers decoding all messages, extending understanding of interference management.

Contribution

It provides new sufficient conditions for achieving interference-free capacity in ergodic fading K-user IFCs, involving channel statistics and power policies.

Findings

Capacity region achieved when all receivers decode all messages

Conditions depend on channel statistics and waterfilling power policies

Results have implications in combinatorics

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.