Optimal order of decoding for max-min fairness in K-user memoryless interference channels

Mohammad Ali Maddah-Ali, Hajar Mahdavi-Doost, Amir K. Khandani

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationProceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages2866-2870
Number of pages5
DOIs
StatePublished - 2007
Externally publishedYes
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: Jun 24 2007Jun 29 2007

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/TerritoryFrance
CityNice
Period6/24/076/29/07

Fingerprint

Dive into the research topics of 'Optimal order of decoding for max-min fairness in K-user memoryless interference channels'. Together they form a unique fingerprint.

Cite this