The capacity of the Multiple Access Channel under distributed scheduling and MMSE decoding

Joseph Kampeas, Asaf Cohen, Omer Gurewitz

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this work, we consider the problem of a Multiple-Input Single-Output (MISO) Multiple-Access Channel with a large number of users K. In practical scenarios, only a small sub-set of the users can be scheduled simultaneously. However, since solutions which collect Channel State Information (CSI) from all users and schedule the best subset to transmit do not scale with K, distributed scheduling algorithms are advantageous. We analyze a distributed scheduling algorithm, which selects a group of users to transmit without coordinating between the users and without all users sending CSI to the base station. The expected capacity under Minimum Mean Squared Error (MMSE) decoding is given, with a special emphasis on large K. It is shown that the algorithm achieves the same scaling laws as the optimal centralized scheme.

Original languageEnglish
Title of host publication2014 IEEE Information Theory Workshop, ITW 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages491-495
Number of pages5
ISBN (Electronic)9781479959990
DOIs
StatePublished - 1 Dec 2014
Event2014 IEEE Information Theory Workshop, ITW 2014 - Hobart, Australia
Duration: 2 Nov 20145 Nov 2014

Publication series

Name2014 IEEE Information Theory Workshop, ITW 2014

Conference

Conference2014 IEEE Information Theory Workshop, ITW 2014
Country/TerritoryAustralia
CityHobart
Period2/11/145/11/14

Fingerprint

Dive into the research topics of 'The capacity of the Multiple Access Channel under distributed scheduling and MMSE decoding'. Together they form a unique fingerprint.

Cite this