Sparsity-Aware Ordered Successive Interference Cancellation for Massive Machine-Type Communications

Jinyoup Ahn, Byonghyo Shim, Kwang Bok Lee

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In massive machine-type communication (mMTC) systems, by exploiting sporadic device activities, compressed sensing based multi-user detection (CS-MUD) is used to recover sparse multi-user vectors. In CS-MUD, multi-user vectors are detected based on a sparsity-aware maximum a posteriori probability (S-MAP) criterion. To reduce the computational complexity of S-MAP detection, a sparsity-aware successive interference cancellation (SA-SIC) technique can be used. However, SA-SIC does not perform well without proper layer sorting due to error propagation. In this paper, we propose a novel sparsity-aware ordered SIC scheme that finds the optimal detection order based on the activity probabilities and channel gains of devices. Simulation results verify that the proposed scheme greatly improves the performance of SA-SIC.

Original languageEnglish
JournalIEEE Wireless Communications Letters
DOIs
Publication statusAccepted/In press - 2017 Oct 6
Externally publishedYes

Fingerprint

Compressed sensing
Multiuser detection
Communication
Sorting
Computational complexity
Communication systems

Keywords

  • Base stations
  • compressed sensing
  • Computational complexity
  • Interference cancellation
  • Massive machine-type communication
  • Matrix decomposition
  • multi-user detection.
  • Multiuser detection
  • Performance evaluation
  • Silicon carbide
  • sporadic communication
  • successive interference cancellation

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Sparsity-Aware Ordered Successive Interference Cancellation for Massive Machine-Type Communications. / Ahn, Jinyoup; Shim, Byonghyo; Lee, Kwang Bok.

In: IEEE Wireless Communications Letters, 06.10.2017.

Research output: Contribution to journalArticle

@article{9830d26f0e0c43378571b447e98c6806,
title = "Sparsity-Aware Ordered Successive Interference Cancellation for Massive Machine-Type Communications",
abstract = "In massive machine-type communication (mMTC) systems, by exploiting sporadic device activities, compressed sensing based multi-user detection (CS-MUD) is used to recover sparse multi-user vectors. In CS-MUD, multi-user vectors are detected based on a sparsity-aware maximum a posteriori probability (S-MAP) criterion. To reduce the computational complexity of S-MAP detection, a sparsity-aware successive interference cancellation (SA-SIC) technique can be used. However, SA-SIC does not perform well without proper layer sorting due to error propagation. In this paper, we propose a novel sparsity-aware ordered SIC scheme that finds the optimal detection order based on the activity probabilities and channel gains of devices. Simulation results verify that the proposed scheme greatly improves the performance of SA-SIC.",
keywords = "Base stations, compressed sensing, Computational complexity, Interference cancellation, Massive machine-type communication, Matrix decomposition, multi-user detection., Multiuser detection, Performance evaluation, Silicon carbide, sporadic communication, successive interference cancellation",
author = "Jinyoup Ahn and Byonghyo Shim and Lee, {Kwang Bok}",
year = "2017",
month = "10",
day = "6",
doi = "10.1109/LWC.2017.2760831",
language = "English",
journal = "IEEE Wireless Communications Letters",
issn = "2162-2337",
publisher = "IEEE Communications Society",

}

TY - JOUR

T1 - Sparsity-Aware Ordered Successive Interference Cancellation for Massive Machine-Type Communications

AU - Ahn, Jinyoup

AU - Shim, Byonghyo

AU - Lee, Kwang Bok

PY - 2017/10/6

Y1 - 2017/10/6

N2 - In massive machine-type communication (mMTC) systems, by exploiting sporadic device activities, compressed sensing based multi-user detection (CS-MUD) is used to recover sparse multi-user vectors. In CS-MUD, multi-user vectors are detected based on a sparsity-aware maximum a posteriori probability (S-MAP) criterion. To reduce the computational complexity of S-MAP detection, a sparsity-aware successive interference cancellation (SA-SIC) technique can be used. However, SA-SIC does not perform well without proper layer sorting due to error propagation. In this paper, we propose a novel sparsity-aware ordered SIC scheme that finds the optimal detection order based on the activity probabilities and channel gains of devices. Simulation results verify that the proposed scheme greatly improves the performance of SA-SIC.

AB - In massive machine-type communication (mMTC) systems, by exploiting sporadic device activities, compressed sensing based multi-user detection (CS-MUD) is used to recover sparse multi-user vectors. In CS-MUD, multi-user vectors are detected based on a sparsity-aware maximum a posteriori probability (S-MAP) criterion. To reduce the computational complexity of S-MAP detection, a sparsity-aware successive interference cancellation (SA-SIC) technique can be used. However, SA-SIC does not perform well without proper layer sorting due to error propagation. In this paper, we propose a novel sparsity-aware ordered SIC scheme that finds the optimal detection order based on the activity probabilities and channel gains of devices. Simulation results verify that the proposed scheme greatly improves the performance of SA-SIC.

KW - Base stations

KW - compressed sensing

KW - Computational complexity

KW - Interference cancellation

KW - Massive machine-type communication

KW - Matrix decomposition

KW - multi-user detection.

KW - Multiuser detection

KW - Performance evaluation

KW - Silicon carbide

KW - sporadic communication

KW - successive interference cancellation

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

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

U2 - 10.1109/LWC.2017.2760831

DO - 10.1109/LWC.2017.2760831

M3 - Article

JO - IEEE Wireless Communications Letters

JF - IEEE Wireless Communications Letters

SN - 2162-2337

ER -