The ergodic capacity of the multiple access channel under distributed scheduling - Order optimality of linear receivers

Joseph Kampeas, Asaf Cohen, Omer Gurewitz

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

Consider the problem of a multiple-input multiple-output multiple-access channel at the limit of large number of users. Clearly, in practical scenarios, only a small subset of the users can be scheduled to utilize the channel simultaneously. Thus, a problem of user selection arises. However, since solutions which collect channel state information from all users and decide on the best subset to transmit in each slot do not scale when the number of users is large, distributed algorithms for user selection are advantageous. In this paper, we analyze a distributed user selection algorithm, which selects a group of users to transmit without coordinating between users and without all users sending CSI to the base station. This threshold-based algorithm is analyzed for both zero-forcing and minimum mean square error receivers, and its expected sum rate in the limit of large number of users is investigated. It is shown that for large number of users, it achieves the same scaling laws as the optimal centralized scheme.

Original languageEnglish
Pages (from-to)5898-5919
Number of pages22
JournalIEEE Transactions on Information Theory
Volume64
Issue number8
DOIs
StatePublished - 1 Aug 2018

Keywords

  • Ergodic capacity
  • distributed scheduling
  • multi-access channel
  • zero-forcing and MMSE detection

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint

Dive into the research topics of 'The ergodic capacity of the multiple access channel under distributed scheduling - Order optimality of linear receivers'. Together they form a unique fingerprint.

Cite this