Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 26 Oct 2009 in cs.IT and math.IT | (0910.4874v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.