English
Related papers

Related papers: An ODMA-Based Unsourced Random Access Scheme with …

200 papers

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where…

Information Theory · Computer Science 2021-02-16 Vamsi K. Amalladinne , Allen Hao , Stefano Rini , Jean-Francois Chamberland

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 considers a class of multi-channel random access algorithms, where contending devices may send multiple copies (replicas) of their messages to the central base station. We first develop a hypothetical algorithm that delivers a…

Information Theory · Computer Science 2017-05-15 Olga Galinina , Andrey Turlikov , Sergey Andreev , Yevgeni Koucheryavy

A massive MIMO system, represented by a base station with hundreds of antennas, is capable of spatially multiplexing many devices and thus naturally suited to serve dense crowds of wireless devices in emerging applications, such as…

Information Theory · Computer Science 2017-09-06 Elisabeth de Carvalho , Emil Björnson , Jesper H. Sørensen , Erik G. Larsson , Petar Popovski

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

Large communication networks, e.g. Internet of Things (IoT), are known to be vulnerable to co-channel interference. One possibility to address this issue is the use of orthogonal multiple access (OMA) techniques. However, due to a…

Information Theory · Computer Science 2020-03-20 Steven Kisseleff , Symeon Chatzinotas , Björn Ottersten

The conventional grant-based network relies on the handshaking between base station and active users to achieve dynamic multi-user scheduling, which may cost large signaling overheads as well as system latency. To address those problems,…

Signal Processing · Electrical Eng. & Systems 2017-11-27 Fan Wei , Wen Chen , Yongpeng Wu , Jun Ma , Theodoros A. Tsiftsis

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

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 investigates the multiple-input-multiple-output (MIMO) massive unsourced random access in an asynchronous orthogonal frequency division multiplexing (OFDM) system, with both timing and frequency offsets (TFO) and non-negligible…

Information Theory · Computer Science 2023-08-21 Tianya Li , Yongpeng Wu , Wenjun Zhang , Xiang-Gen Xia , Chengshan Xiao

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 superimposed pilot transmission scheme offers substantial potential for improving spectral efficiency in MIMO-OFDM systems, but it presents significant challenges for receiver design due to pilot contamination and data interference. To…

Information Theory · Computer Science 2025-07-15 Xinjie Li , Xingyu Zhou , Yixiao Cao , Jing Zhang , Chao-Kai Wen , Xiao Li , Shi Jin

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

A new universal coding/decoding scheme for random access with collision detection is given in the case of two senders. The result is used to give an achievable joint source-channel coding error exponent for multiple access channels in the…

Information Theory · Computer Science 2013-09-19 Lóránt Farkas , Tamás Kói

Random access is a multiple access communication protocol where the users simultaneously communicate with a base station (BS) in an uncoordinated fashion. In this work, we consider the problem of multiuser detection in a random access…

Information Theory · Computer Science 2016-07-15 Md Mashud Hyder

We consider the detection of correlated information sources in the ubiquitous Code-Division Multiple-Access (CDMA) scheme. We propose a message-passing based scheme for detecting correlated sources directly, with no need for source coding.…

Information Theory · Computer Science 2010-03-24 Hadar Efraim , Nadav Yacov , Ori Shental , Ido Kanter

We study a delay-constrained grant-free random access system with a multi-antenna base station. The users randomly generate data packets with expiration deadlines, which are then transmitted from data queues on a first-in first-out basis.…

Information Theory · Computer Science 2024-10-23 Jianan Bai , Zheng Chen , Erik. G. Larsson

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

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

Orthogonal Frequency Division Multiple Access (OFDMA) as well as other orthogonal multiple access techniques fail to achieve the system capacity limit in the uplink due to the exclusivity in resource allocation. This issue is more prominent…

Information Theory · Computer Science 2017-05-12 Mohammed Al-Imari , Pei Xiao , Muhammad Ali Imran , Rahim Tafazolli