Joint Channel Estimation and MUD for Scalable Grant-Free Random Access

Ameha Tsegaye Abebe, Chung G. Kang

Research output: Contribution to journalArticle

Abstract

A scalable grant-free access, which simultaneously reduces access collision rate and signaling overhead, can be enabled by allowing contending users to randomly select a preamble from a very large set of non-orthogonal preamble sequences. By casting the joint channel estimation and multi-user detection (CE-MUD) problem into a multiple measurement vector (MMV)-based compressive sensing problem and employing a two-stage active preambles search over a narrowed subspace, a scheme proposed in this letter shows significant performance improvement over conventional schemes. Particularly, the two-stage search allows the proposed scheme to support multiple order of more active users while reducing receiver's complexity.

Original languageEnglish
Article number8861377
Pages (from-to)2229-2233
Number of pages5
JournalIEEE Communications Letters
Volume23
Issue number12
DOIs
Publication statusPublished - 2019 Dec

Fingerprint

Multiuser detection
Random Access
Channel Estimation
Channel estimation
Casting
Multiuser Detection
Compressive Sensing
Large Set
Receiver
Collision
Subspace

Keywords

  • channel estimation
  • compressive sensing
  • grant-free random access
  • MUD
  • Non-orthogonal preamble sequences

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Joint Channel Estimation and MUD for Scalable Grant-Free Random Access. / Abebe, Ameha Tsegaye; Kang, Chung G.

In: IEEE Communications Letters, Vol. 23, No. 12, 8861377, 12.2019, p. 2229-2233.

Research output: Contribution to journalArticle

@article{ba5954a2283e4a91a2e09a6655ea5b38,
title = "Joint Channel Estimation and MUD for Scalable Grant-Free Random Access",
abstract = "A scalable grant-free access, which simultaneously reduces access collision rate and signaling overhead, can be enabled by allowing contending users to randomly select a preamble from a very large set of non-orthogonal preamble sequences. By casting the joint channel estimation and multi-user detection (CE-MUD) problem into a multiple measurement vector (MMV)-based compressive sensing problem and employing a two-stage active preambles search over a narrowed subspace, a scheme proposed in this letter shows significant performance improvement over conventional schemes. Particularly, the two-stage search allows the proposed scheme to support multiple order of more active users while reducing receiver's complexity.",
keywords = "channel estimation, compressive sensing, grant-free random access, MUD, Non-orthogonal preamble sequences",
author = "Abebe, {Ameha Tsegaye} and Kang, {Chung G.}",
year = "2019",
month = "12",
doi = "10.1109/LCOMM.2019.2945577",
language = "English",
volume = "23",
pages = "2229--2233",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

TY - JOUR

T1 - Joint Channel Estimation and MUD for Scalable Grant-Free Random Access

AU - Abebe, Ameha Tsegaye

AU - Kang, Chung G.

PY - 2019/12

Y1 - 2019/12

N2 - A scalable grant-free access, which simultaneously reduces access collision rate and signaling overhead, can be enabled by allowing contending users to randomly select a preamble from a very large set of non-orthogonal preamble sequences. By casting the joint channel estimation and multi-user detection (CE-MUD) problem into a multiple measurement vector (MMV)-based compressive sensing problem and employing a two-stage active preambles search over a narrowed subspace, a scheme proposed in this letter shows significant performance improvement over conventional schemes. Particularly, the two-stage search allows the proposed scheme to support multiple order of more active users while reducing receiver's complexity.

AB - A scalable grant-free access, which simultaneously reduces access collision rate and signaling overhead, can be enabled by allowing contending users to randomly select a preamble from a very large set of non-orthogonal preamble sequences. By casting the joint channel estimation and multi-user detection (CE-MUD) problem into a multiple measurement vector (MMV)-based compressive sensing problem and employing a two-stage active preambles search over a narrowed subspace, a scheme proposed in this letter shows significant performance improvement over conventional schemes. Particularly, the two-stage search allows the proposed scheme to support multiple order of more active users while reducing receiver's complexity.

KW - channel estimation

KW - compressive sensing

KW - grant-free random access

KW - MUD

KW - Non-orthogonal preamble sequences

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

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

U2 - 10.1109/LCOMM.2019.2945577

DO - 10.1109/LCOMM.2019.2945577

M3 - Article

AN - SCOPUS:85076705173

VL - 23

SP - 2229

EP - 2233

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

IS - 12

M1 - 8861377

ER -