Comprehensive grant-free random access for massive & low latency communication

Ameha T. Abebe, Chung Gu Kang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

In this paper, we introduce a comprehensive grant-free random access scheme for machine-type communication which is characterized by massive connectivity and low latency. The scheme presented in here is comprehensive in a sense that, synchronization, channel estimation, and users identification & data detection (multi-user detection) are performed all in a single shot. The scheme employs compressive sensing by exploiting two sparse phenomena: sparsity in users activity and sparsity in multi-path channel. Furthermore, the scheme is designed in such a way that channel estimation and multi-user detection have a bi-directional mutual relationship, enabling one to reinforce the other for accurate detection and estimation. Moreover, the iterative order recursive least square (IORLS) estimation algorithm is modified & employed in such a way that it exploits the joint structure in multi-path channel and multi-user signal sparsity.

Original languageEnglish
Title of host publication2017 IEEE International Conference on Communications, ICC 2017
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781467389990
DOIs
Publication statusPublished - 2017 Jul 28
Event2017 IEEE International Conference on Communications, ICC 2017 - Paris, France
Duration: 2017 May 212017 May 25

Other

Other2017 IEEE International Conference on Communications, ICC 2017
CountryFrance
CityParis
Period17/5/2117/5/25

Fingerprint

Multiuser detection
Multipath propagation
Channel estimation
Communication
Identification (control systems)
Synchronization

Keywords

  • compressive sensing
  • machine-type communication
  • multi-user detection
  • sparse channel detection
  • synchronization

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Abebe, A. T., & Kang, C. G. (2017). Comprehensive grant-free random access for massive & low latency communication. In 2017 IEEE International Conference on Communications, ICC 2017 [7996932] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2017.7996932

Comprehensive grant-free random access for massive & low latency communication. / Abebe, Ameha T.; Kang, Chung Gu.

2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc., 2017. 7996932.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abebe, AT & Kang, CG 2017, Comprehensive grant-free random access for massive & low latency communication. in 2017 IEEE International Conference on Communications, ICC 2017., 7996932, Institute of Electrical and Electronics Engineers Inc., 2017 IEEE International Conference on Communications, ICC 2017, Paris, France, 17/5/21. https://doi.org/10.1109/ICC.2017.7996932
Abebe AT, Kang CG. Comprehensive grant-free random access for massive & low latency communication. In 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc. 2017. 7996932 https://doi.org/10.1109/ICC.2017.7996932
Abebe, Ameha T. ; Kang, Chung Gu. / Comprehensive grant-free random access for massive & low latency communication. 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronics Engineers Inc., 2017.
@inproceedings{ad93ed7f47394487be916bfced5b1102,
title = "Comprehensive grant-free random access for massive & low latency communication",
abstract = "In this paper, we introduce a comprehensive grant-free random access scheme for machine-type communication which is characterized by massive connectivity and low latency. The scheme presented in here is comprehensive in a sense that, synchronization, channel estimation, and users identification & data detection (multi-user detection) are performed all in a single shot. The scheme employs compressive sensing by exploiting two sparse phenomena: sparsity in users activity and sparsity in multi-path channel. Furthermore, the scheme is designed in such a way that channel estimation and multi-user detection have a bi-directional mutual relationship, enabling one to reinforce the other for accurate detection and estimation. Moreover, the iterative order recursive least square (IORLS) estimation algorithm is modified & employed in such a way that it exploits the joint structure in multi-path channel and multi-user signal sparsity.",
keywords = "compressive sensing, machine-type communication, multi-user detection, sparse channel detection, synchronization",
author = "Abebe, {Ameha T.} and Kang, {Chung Gu}",
year = "2017",
month = "7",
day = "28",
doi = "10.1109/ICC.2017.7996932",
language = "English",
booktitle = "2017 IEEE International Conference on Communications, ICC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Comprehensive grant-free random access for massive & low latency communication

AU - Abebe, Ameha T.

AU - Kang, Chung Gu

PY - 2017/7/28

Y1 - 2017/7/28

N2 - In this paper, we introduce a comprehensive grant-free random access scheme for machine-type communication which is characterized by massive connectivity and low latency. The scheme presented in here is comprehensive in a sense that, synchronization, channel estimation, and users identification & data detection (multi-user detection) are performed all in a single shot. The scheme employs compressive sensing by exploiting two sparse phenomena: sparsity in users activity and sparsity in multi-path channel. Furthermore, the scheme is designed in such a way that channel estimation and multi-user detection have a bi-directional mutual relationship, enabling one to reinforce the other for accurate detection and estimation. Moreover, the iterative order recursive least square (IORLS) estimation algorithm is modified & employed in such a way that it exploits the joint structure in multi-path channel and multi-user signal sparsity.

AB - In this paper, we introduce a comprehensive grant-free random access scheme for machine-type communication which is characterized by massive connectivity and low latency. The scheme presented in here is comprehensive in a sense that, synchronization, channel estimation, and users identification & data detection (multi-user detection) are performed all in a single shot. The scheme employs compressive sensing by exploiting two sparse phenomena: sparsity in users activity and sparsity in multi-path channel. Furthermore, the scheme is designed in such a way that channel estimation and multi-user detection have a bi-directional mutual relationship, enabling one to reinforce the other for accurate detection and estimation. Moreover, the iterative order recursive least square (IORLS) estimation algorithm is modified & employed in such a way that it exploits the joint structure in multi-path channel and multi-user signal sparsity.

KW - compressive sensing

KW - machine-type communication

KW - multi-user detection

KW - sparse channel detection

KW - synchronization

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

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

U2 - 10.1109/ICC.2017.7996932

DO - 10.1109/ICC.2017.7996932

M3 - Conference contribution

AN - SCOPUS:85020206449

BT - 2017 IEEE International Conference on Communications, ICC 2017

PB - Institute of Electrical and Electronics Engineers Inc.

ER -