English
Related papers

Related papers: Massive Unsourced Random Access for Massive MIMO C…

200 papers

Massive MIMO systems, where base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of user equipments (UEs) increases, the initial access and handover in…

Signal Processing · Electrical Eng. & Systems 2018-06-20 Luca Sanguinetti , Antonio A. D'Amico , Michele Morelli , Merouane Debbah

Cell-Free Massive MIMO systems aim to expand the coverage area of wireless networks by replacing a single high-performance Access Point (AP) with multiple small, distributed APs connected to a Central Processing Unit (CPU) through a…

Information Theory · Computer Science 2023-11-13 Michail Gkagkos , Jean-Francois Chamberland , Costas N. Georghiades , Krishna R. Narayanan

In this work we treat the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we consider the slowly fading scenario where the coherence block-length is large compared to the…

Information Theory · Computer Science 2021-09-22 Alexander Fengler , Osman Musa , Peter Jung , Giuseppe Caire

In this paper, we investigate an unsourced random access scheme for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks with sporadic data traffic. Firstly, we establish a general framework for massive…

Information Theory · Computer Science 2022-03-01 Feiyan Tian , Xiaoming Chen , Lei Liu , Derrick Wing Kwan Ng

Unsourced random access (URA) is an increasingly popular communication paradigm attuned to machine driven data transfers in \textit{Internet-of-Things} (IoT) networks. In a typical URA setting, a small subset of active devices within a very…

Information Theory · Computer Science 2021-05-06 Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

In this paper we focus on a feedback mechanism for unsourced random access (URA) communications. We propose an algorithm to construct feedback packets broadcasted to the users by the base station (BS) as well as the feedback packet format…

Information Theory · Computer Science 2022-11-23 Murwan Bashir , Ehsan Nassaji , Dmitri Truhachev , Alireza Bayesteh , Monirosharieh Vameghestahbanati

This paper is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated…

Information Theory · Computer Science 2024-08-20 Gianluigi Liva , Yury Polyanskiy

Massive MIMO systems, where the base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of users increases, the initial access and handover in contemporary…

Information Theory · Computer Science 2016-05-04 Luca Sanguinetti , Antonio A. D'Amico , Michele Morelli , Merouane Debbah

Massive machine-type communications (mMTC) demand robust solutions to support extensive connectivity efficiently. Unsourced random access (URA) has emerged as a promising approach, delivering high spectral and energy efficiency. Among URA…

Information Theory · Computer Science 2025-12-25 Liandong Hu , Jian Dang , Zaichen Zhang

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense…

Information Theory · Computer Science 2021-03-23 Ameha Tsegaye Abebe , Chung G. Kang

This paper considers the massive MIMO unsourced random access problem in a quasi-static Rayleigh fading setting. The proposed coding scheme is based on a concatenation of a "conventional" channel code (such as, e.g., LDPC) serving as an…

Signal Processing · Electrical Eng. & Systems 2023-05-01 Patrick Agostini , Zoran Utkovski , Slawomir Stanczak

Emerging communication networks are envisioned to support massive wireless connectivity of heterogeneous devices with sporadic traffic and diverse requirements in terms of latency, reliability, and bandwidth. Providing multiple access to an…

Information Theory · Computer Science 2023-04-19 Sajad Daei , Marios Kountouris

We extend the seminal work by Polyanskiy (2017) on massive uncoordinated access to the case where the number of active users is random and unknown a priori. We define a random-access code accounting for both misdetection (MD) and false…

Information Theory · Computer Science 2022-02-15 Khac-Hoang Ngo , Alejandro Lancho , Giuseppe Durisi , Alexandre Graell i Amat

In this paper, we investigate unsourced random access for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks. Firstly, we establish a high-efficiency uncoupled framework for massive unsourced random…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Yong Liang Guan , Chau Yuen

This paper investigates the problem of joint massive devices separation and channel estimation for a reconfigurable intelligent surface (RIS)-aided unsourced random access (URA) scheme in the sixth-generation (6G) wireless networks. In…

Information Theory · Computer Science 2021-08-26 Xiaodan Shao , Lei Cheng , Xiaoming Chen , Chongwen Huang , Derrick Wing Kwan Ng

We consider unsourced random access (uRA) in user-centric cell-free (CF) wireless networks, where random access users send codewords from a common codebook during specifically dedicated random access channel (RACH) slots. The system is…

Information Theory · Computer Science 2024-08-16 Eleni Gkiouzepi , Burak Çakmak , Manfred Opper , Giuseppe Caire

In this work we treat the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we consider the slowly fading scenario where the coherence block-length is large compared to the…

Information Theory · Computer Science 2021-08-11 Alexander Fengler , Peter Jung , Giuseppe Caire

The spatial diversity and multiplexing advantages of massive multi-input-multi-output (mMIMO) can significantly improve the capacity of massive non-orthogonal multiple access (NOMA) in machine type communications. However, state-of-the-art…

Signal Processing · Electrical Eng. & Systems 2025-02-17 Yueqing Wang , Yikun Mei , Zhen Gao , Ziwei Wan , Boyu Ning , De Mi , Sami Muhaidat

To account for the massive uncoordinated random access scenario, which is relevant for the Internet of Things, Polyanskiy (2017) proposed a novel formulation of the multiple-access problem, commonly referred to as unsourced multiple access,…

Information Theory · Computer Science 2023-02-23 Khac-Hoang Ngo , Alejandro Lancho , Giuseppe Durisi , Alexandre Graell i Amat

We propose a novel generalized framework for grant-free random-access (GFRA) in cell-free massive multiple input multiple-output systems where multiple geographically separated access points (APs) or base stations (BSs) aim to detect…

Signal Processing · Electrical Eng. & Systems 2024-11-20 Sai Subramanyam Thoota , Erik G. Larsson