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

TL;DR

This paper develops and proves the optimality of a greedy decoding order algorithm to maximize the minimum data rate among users in a $K$-user memoryless interference channel, considering various decoding subsets and orders.

Contribution

It introduces a novel greedy algorithm for decoding order selection in interference channels and proves its optimality for max-min fairness.

Findings

The algorithm maximizes the minimum user rate.

Optimal decoding order can be systematically determined.

The approach improves fairness in interference channels.

Abstract

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.