English
Related papers

Related papers: Joint Message Detection, Channel, and User Positio…

200 papers

Code-expanded Random Access (CeRA) is a promising technique for supporting mMTC in cellular IoT networks. However, its potentiality is limited by code ambiguity, which results from the inference of a larger number of codewords than those…

Information Theory · Computer Science 2021-05-28 Carlos A. Astudillo , Ekram Hossain , Nelson L. S. da Fonseca

We consider the problem of type estimation over unsourced multiple access fading channels in distributed multiple-input multiple-output (D-MIMO) systems. Unlike classical unsourced multiple access, type-based unsourced multiple access…

Information Theory · Computer Science 2026-03-03 Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi , Erik G. Ström

The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…

Information Theory · Computer Science 2019-06-11 Zhuo Sun

Type-based unsourced multiple access (TUMA) is a recently proposed framework for type-based estimation in massive uncoordinated access networks. We extend the existing design of TUMA, developed for an additive white Gaussian channel, to a…

Information Theory · Computer Science 2025-04-29 Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi , Erik G. Ström

The cell-free massive multiple-input multiple-output (CF-mMIMO) systems are crucial for 6G development due to their high spectral efficiency and uniform user-experienced data rates. A key aspect of CF-mMIMO is user association (UA) and…

Signal Processing · Electrical Eng. & Systems 2025-08-28 Ahmed Naeem , El Mehdi Amhoud , Hüseyin Arslan

Unsourced random access (URA) has emerged as a promising paradigm for enabling massive connectivity in Internet-of-Things (IoT) networks. However, since URA transmissions do not contain device identifiers, the receiver may not associate…

Signal Processing · Electrical Eng. & Systems 2026-05-19 Wenbo Fan , Zeping Sui , Yuhei Takahashi , Jun Cheng , Zilong Liu , Pingzhi Fan

Next generation cellular networks will have to leverage large cell densifications to accomplish the ambitious goals for aggregate multi-user sum rates, for which CRAN architecture is a favored network design. This shifts the attention back…

Information Theory · Computer Science 2017-03-31 Sahar Imtiaz , Hadi Ghauch , Muhammad Mahboob Ur Rahman , George Koudouridis , James Gross

We propose an improvement of the random spreading approach with polar codes for unsourced multiple access. Each user encodes its message by a polar code, and the coded bits are then spread using a random spreading sequence. The proposed…

Information Theory · Computer Science 2021-08-30 Mohammad Javad Ahmadi , Tolga M. Duman

This paper explores the fundamental limits of unsourced random access (URA) with a random and unknown number ${\rm{K}}_a$ of active users in MIMO quasi-static Rayleigh fading channels. First, we derive an upper bound on the probability of…

Information Theory · Computer Science 2024-04-16 Junyuan Gao , Yongpeng Wu , Giuseppe Caire , Wei Yang , Wenjun Zhang

This paper investigates asynchronous multiple-input multiple-output (MIMO) massive unsourced random access (URA) in an orthogonal frequency division multiplexing (OFDM) system over frequency-selective fading channels, with the presence of…

Information Theory · Computer Science 2024-10-24 Tianya Li , Yongpeng Wu , Junyuan Gao , Wenjun Zhang , Xiang-Gen Xia , Derrick Wing Kwan Ng , Chengshan Xiao

We present an unsourced multiple access (UMAC) scheme tailored to high-mobility wireless channels. The proposed construction is based on orthogonal time frequency space (OTFS) modulation and sparse interleaver division multiple access…

Signal Processing · Electrical Eng. & Systems 2026-01-21 Davide Bergamasco , Federico Clazzer , Paolo Casari

We examine unsourced random access in a fully asynchronous setup, where active users transmit their data without restriction on the start time over a fading channel. In the proposed scheme, the transmitted signal consists of a pilot…

Information Theory · Computer Science 2025-12-23 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

Wi-Fi networks have long relied on the Enhanced Distributed Channel Access (EDCA) mechanism, allowing stations to compete for transmission opportunities. However, as networks become denser and emerging applications demand lower latency and…

Networking and Internet Architecture · Computer Science 2025-06-30 Douglas Dziedzorm Agbeve , Andrey Belogaev , Jeroen Famaey

In this paper, we propose a novel fully Bayesian approach for the massive multiple-input multiple-output (MIMO) massive unsourced random access (URA). The payload of each user device is coded by the sparse regression codes (SPARCs) without…

Information Theory · Computer Science 2023-06-28 Jia-Cheng Jiang , Hui-Ming Wang

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

One of the key challenges in realizing ultra-reliable low-latency communications (uRLLC) for factories-of-the-future (FoF) applications is to enhance the cellular random access channel (RACH) procedure. The state-of-the-art LTE RACH…

Networking and Internet Architecture · Computer Science 2019-01-23 Jayashree Thota , Adnan Aijaz

In this paper, a dynamic channel assigning along with dynamic cell sectoring model has been proposed that focuses on the Fractional Frequency Reuse (FFR) not only for interference mitigation but also for enhancement of overall system…

Networking and Internet Architecture · Computer Science 2018-10-08 Shakil Ahmed , Mohammad Arif Hossain , Mostafa Zaman Chowdhury

In a cell-free massive multiple-input multiple-output (CF-mMIMO) network, multiple access points (APs) actively cooperate to serve users' equipment (UEs). We consider how the random access (RA) problem can be addressed by such a network…

Information Theory · Computer Science 2022-02-18 Victor Croisfelt , Taufik Abrão , José Carlos Marinello

This work explores the channel estimation (CE) problem in uplink transmission for unsourced random access (URA) with a fluid antenna receiver. The additional spatial diversity in a fluid antenna system (FAS) addresses the needs of URA…

Information Theory · Computer Science 2025-04-25 Keru Zhou , Zhentian Zhang , Jian Dang , Qianqian Sun , Zaichen Zhang

The cellular Internet-of-Things has resulted in the deployment of millions of machine-type communication (MTC) devices. These massive number of devices must communicate with a single gNodeB (gNB) via the random access channel (RACH)…