A suboptimal scheme for multi-user scheduling in gaussian broadcast channels

Ammar Zafar, Mohammad Shaqfeh, Mohamed Slim Alouini, Hussein Alnuweiri

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.

Original languageEnglish
Article number6880786
Pages (from-to)136-140
Number of pages5
JournalIEEE Signal Processing Letters
Volume22
Issue number2
DOIs
Publication statusPublished - 2015

Fingerprint

Broadcast Channel
Scheduling
Superposition
Instantaneous
Coding
Interference Cancellation
Integral form
Power Allocation
Closed-form
Numerical Results
Term

Keywords

  • Block-fading
  • broadcast channels
  • multi-user diversity
  • resource allocation
  • superposition coding

ASJC Scopus subject areas

  • Signal Processing
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

A suboptimal scheme for multi-user scheduling in gaussian broadcast channels. / Zafar, Ammar; Shaqfeh, Mohammad; Alouini, Mohamed Slim; Alnuweiri, Hussein.

In: IEEE Signal Processing Letters, Vol. 22, No. 2, 6880786, 2015, p. 136-140.

Research output: Contribution to journalArticle

@article{bf5254bebbe64bee87e0d89c9a420724,
title = "A suboptimal scheme for multi-user scheduling in gaussian broadcast channels",
abstract = "This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.",
keywords = "Block-fading, broadcast channels, multi-user diversity, resource allocation, superposition coding",
author = "Ammar Zafar and Mohammad Shaqfeh and Alouini, {Mohamed Slim} and Hussein Alnuweiri",
year = "2015",
doi = "10.1109/LSP.2014.2350776",
language = "English",
volume = "22",
pages = "136--140",
journal = "IEEE Signal Processing Letters",
issn = "1070-9908",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

TY - JOUR

T1 - A suboptimal scheme for multi-user scheduling in gaussian broadcast channels

AU - Zafar, Ammar

AU - Shaqfeh, Mohammad

AU - Alouini, Mohamed Slim

AU - Alnuweiri, Hussein

PY - 2015

Y1 - 2015

N2 - This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.

AB - This work proposes a suboptimal multi-user scheduling scheme for Gaussian broadcast channels which improves upon the classical single user selection, while considerably reducing complexity as compared to the optimal superposition coding with successful interference cancellation. The proposed scheme combines the two users with the maximum weighted instantaneous rate using superposition coding. The instantaneous rate and power allocation are derived in closed-form, while the long term rate of each user is derived in integral form for all channel distributions. Numerical results are then provided to characterize the prospected gains of the proposed scheme.

KW - Block-fading

KW - broadcast channels

KW - multi-user diversity

KW - resource allocation

KW - superposition coding

UR - http://www.scopus.com/inward/record.url?scp=84906876108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906876108&partnerID=8YFLogxK

U2 - 10.1109/LSP.2014.2350776

DO - 10.1109/LSP.2014.2350776

M3 - Article

VL - 22

SP - 136

EP - 140

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

SN - 1070-9908

IS - 2

M1 - 6880786

ER -