Optimal Order of Decoding for Max-Min Fairness in $K$-User Memoryless Interference Channels

Details Optimal Order of Decoding for Max-Min Fairness in $K$-User Memoryless Interference Channels Optimal Order of Decoding for Max-Min Fairness in $K$-User Memoryless Interference Channels

2007-01-18

arxiv.org/abs/cs/0701118v1

Computer Science

Information Theory

11 Pages, Submitted to IEEE International Symposium on Information Theory(ISIT 2007)

Scientific paper

A $K$-user memoryless interference channel is considered where each receiver sequentially decodes the data of a subset of transmitters before it decodes the data of the designated transmitter. Therefore, the data rate of each transmitter depends on (i) the subset of receivers which decode the data of that transmitter, (ii) the decoding order, employed at each of these receivers. In this paper, a greedy algorithm is developed to find the users which are decoded at each receiver and the corresponding decoding order such that the minimum rate of the users is maximized. It is proven that the proposed algorithm is optimal.

Affiliated with

Also associated with

No associations

Rating

Optimal Order of Decoding for Max-Min Fairness in $K$-User Memoryless Interference Channels 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 Optimal Order of Decoding for Max-Min Fairness in $K$-User Memoryless Interference Channels, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Order of Decoding for Max-Min Fairness in $K$-User Memoryless Interference Channels will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-70531