English
Related papers

Related papers: Deep Learning-Based Active User Detection for Gran…

200 papers

Grant-free non-orthogonal multiple access (NOMA) scheme is considered as a promising candidate for the enabling of massive connectivity and reduced signalling overhead for Internet of Things (IoT) applications in massive machine-type…

Information Theory · Computer Science 2022-05-25 Pengyu Gao , Zilong Liu , Pei Xiao , Chuan Heng Foh , Jing Zhang

In this paper, we present a novel approach for joint activity detection (AD), channel estimation (CE), and data detection (DD) in uplink grant-free non-orthogonal multiple access (NOMA) systems. Our approach employs an iterative and…

Signal Processing · Electrical Eng. & Systems 2024-03-13 Yongjeong Oh , Jaehong Jo , Byonghyo Shim , Yo-Seb Jeon

In this paper, we propose a non-orthogonal multiple access (NOMA)-based communication framework that allows machine type devices (MTDs) to access the network while avoiding congestion. The proposed technique is a 2-step mechanism that first…

Information Theory · Computer Science 2020-09-02 Manal El Tanab , Walaa Hamouda

In the upcoming Internet-of-Things (IoT) era, the communication is often featured by massive connection, sporadic transmission, and small-sized data packets, which poses new requirements on the delay expectation and resource allocation…

Information Theory · Computer Science 2019-10-17 Zhaoji Zhang , Ying Li , Chongwen Huang , Qinghua Guo , Chau Yuen , Yong Liang Guan

Grant-free multiple-access (GFMA) is a valuable research topic, since it can support multiuser transmission with low latency. This paper constructs novel uniquely-decodable multi-amplitude sequence (UDAS) sets for GFMA systems, which can…

Information Theory · Computer Science 2022-04-11 Qi-Yue Yu , Ke-Xun Song

Grant-free sparse code multiple access (GF-SCMA) is considered to be a promising multiple access candidate for future wireless networks. In this paper, we focus on characterizing the performance of uplink GF-SCMA schemes in a network with…

Information Theory · Computer Science 2021-03-19 Ke Lai , Jing Lei , Yansha Deng , Lei Wen , Gaojie Chen

This paper considers an uplink massive machine-type communication (mMTC) scenario, where a large number of user devices are connected to a base station (BS). A novel grant-free massive random access (MRA) strategy is proposed, considering…

Information Theory · Computer Science 2021-02-23 Jia-Cheng Jiang , Hui-Ming Wang

In this work, we study the multiuser detection (MUD) problem for a grant-free massive-device multiple access (MaDMA) system, where a large number of single-antenna user devices transmit sporadic data to a multi-antenna base station (BS).…

Signal Processing · Electrical Eng. & Systems 2022-01-04 Tian Ding , Xiaojun Yuan , Soung Chang Liew

Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthogonal multiple access (NOMA)scheme for massive connectivity and ultra low-latency in future machine-type communication networks. As an evolved variant of code division…

Information Theory · Computer Science 2021-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

Recently, grant-free transmission paradigm has been introduced for massive Internet of Things (IoT) networks to save both time and bandwidth and transmit the message with low latency. In order to accurately decode the message of each device…

Signal Processing · Electrical Eng. & Systems 2023-01-04 Mehrtash Mehrabi , Mostafa Mohammadkarimi , Masoud Ardakani

The flourishing low-Earth orbit (LEO) constellation communication network provides a promising solution for seamless coverage services to Internet-of-Things (IoT) terminals. However, confronted with massive connectivity and rapid variation…

Information Theory · Computer Science 2021-08-04 Xingyu Zhou , Zhen Gao

In this paper, a novel blind multi-user detection(MUD) framework for autonomous grant-free high-overloading non-orthogonal multiple access is introduced in detail aimed at fulfilling the requirements of fifth-generation massive Machine Type…

Information Theory · Computer Science 2017-12-08 Zhifeng Yuan , Yuzhou Hu , Weimin Li , Jianqiang Dai

This article introduces a novel non-orthogonal multiple access (NOMA) scheme for coordinated uplink channels. The scheme builds on the recently proposed sparse-regression low-density parity-check (SR-LDPC) code, and extends the underlying…

Information Theory · Computer Science 2024-10-23 Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

Faced with the massive connection, sporadic transmission, and small-sized data packets in future cellular communication, a grant-free non-orthogonal random access (NORA) system is considered in this paper, which could reduce the access…

Information Theory · Computer Science 2019-10-10 Zhaoji Zhang , Ying Li , Chongwen Huang , Qinghua Guo , Chau Yuen , Yong Liang Guan

The recent works on a deep learning (DL)-based joint design of preamble set for the transmitters and data-aided active user detection (AUD) in the receiver has demonstrated a significant performance improvement for grant-free sparse code…

Information Theory · Computer Science 2022-09-07 Minsig Han , Ameha Tsegaye Abebe , Chung G. Kang

This paper investigates a grant-free non-orthogonal multiple access (GF-NOMA) system in the presence of carrier frequency offsets. We propose two schemes for enumerating active users in such a GF-NOMA system, which is equivalent to…

Information Theory · Computer Science 2024-11-08 Takanori Hara

Sparse Code Multiple Access (SCMA) is a disruptive code-domain non-orthogonal multiple access (NOMA) scheme to enable \color{black}future massive machine-type communication networks. As an evolved variant of code division multiple access…

Signal Processing · Electrical Eng. & Systems 2022-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

In this paper, a novel uncoordinated random access (URA) protocol is presented to address the pressing demand for massive connectivity with low access latency in future massive machine type communication (mMTC) scenarios. The proposed URA…

Signal Processing · Electrical Eng. & Systems 2025-10-28 Pengyu Gao , Qu Luo , Jing Zhu , Gaojie Chen , Pei Xiao , Chuan Heng Foh

In massive machine-type communications (mMTC), grant-free access is a key enabler for a massive number of users to be connected to a base station with low signaling overhead and low latency. In this paper, a two-stage genetic algorithm (GA)…

Information Theory · Computer Science 2021-08-03 Nam Yul Yu

Massive MIMO is considered a key enabler to support massive machine-type communication (mMTC). While massive access schemes have been extensively analyzed for co-located massive MIMO arrays, this paper explores activity detection in…

Signal Processing · Electrical Eng. & Systems 2025-03-14 Ali Elkeshawy , Haifa Fares , Amor Nafkha