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

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

2009-10-26

arxiv.org/abs/0910.4874v1

Computer Science

Information Theory

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

K-User Fading Interference Channels: The Ergodic Very Strong Case 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 K-User Fading Interference Channels: The Ergodic Very Strong Case, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and K-User Fading Interference Channels: The Ergodic Very Strong Case will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-562882