Home > Research > Publications & Outputs > Non-orthogonal multiple access combined with ra...

Electronic data

  • SPL_21799_2017_CameraReady

    Accepted author manuscript, 112 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

Non-orthogonal multiple access combined with random linear network coded cooperation

Research output: Contribution to journalJournal article

Published

Standard

Non-orthogonal multiple access combined with random linear network coded cooperation. / Khan, Amjad Saeed; Chatzigeorgiou, Ioannis.

In: IEEE Signal Processing Letters, Vol. 24, No. 9, 09.2017, p. 1298-1302.

Research output: Contribution to journalJournal article

Harvard

APA

Vancouver

Author

Bibtex

@article{e3bdcfba67824478a053345e35f112c0,
title = "Non-orthogonal multiple access combined with random linear network coded cooperation",
abstract = "This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance of the proposed scheme is developed, compared to simulation results and benchmarked against a counterpartscheme that is based on orthogonal multiple access.",
keywords = "Decoding probability, network coding, non-orthogonal multiple access (NOMA), sparse random matrices, throughput",
author = "Khan, {Amjad Saeed} and Ioannis Chatzigeorgiou",
note = "{\textcopyright}2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.",
year = "2017",
month = sep
doi = "10.1109/LSP.2017.2723159",
language = "English",
volume = "24",
pages = "1298--1302",
journal = "IEEE Signal Processing Letters",
issn = "1070-9908",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

RIS

TY - JOUR

T1 - Non-orthogonal multiple access combined with random linear network coded cooperation

AU - Khan, Amjad Saeed

AU - Chatzigeorgiou, Ioannis

N1 - ©2017 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

PY - 2017/9

Y1 - 2017/9

N2 - This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance of the proposed scheme is developed, compared to simulation results and benchmarked against a counterpartscheme that is based on orthogonal multiple access.

AB - This letter considers two groups of source nodes. Each group transmits packets to its own designated destination node over single-hop links and via a cluster of relay nodes shared by both groups. In an effort to boost reliability without sacrificing throughput, a scheme is proposed, whereby packets at the relay nodes are combined using two methods; packets delivered by different groups are mixed using non-orthogonal multiple access principles, while packets originating from the same group are mixed using random linear network coding. An analytical framework that characterizes the performance of the proposed scheme is developed, compared to simulation results and benchmarked against a counterpartscheme that is based on orthogonal multiple access.

KW - Decoding probability

KW - network coding

KW - non-orthogonal multiple access (NOMA)

KW - sparse random matrices

KW - throughput

U2 - 10.1109/LSP.2017.2723159

DO - 10.1109/LSP.2017.2723159

M3 - Journal article

VL - 24

SP - 1298

EP - 1302

JO - IEEE Signal Processing Letters

JF - IEEE Signal Processing Letters

SN - 1070-9908

IS - 9

ER -