English
Related papers

Related papers: ODMA-Based Cell-Free Unsourced Random Access with …

200 papers

Wireless random access protocols are attracting a revived research interest as a simple yet effective solution for machine-type communications. In the quest to improve reliability and spectral efficiency of such schemes, the use of multiple…

Information Theory · Computer Science 2019-03-11 Andrea Munari , Federico Clazzer , Gianluigi Liva , Michael Heindlmaier

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 present a novel access protocol for crowd scenarios in massive MIMO (Multiple-input multiple-output) systems. Crowd scenarios are characterized by a large number of users with intermittent access behavior, whereby orthogonal scheduling…

Information Theory · Computer Science 2016-05-20 Jesper H. Sørensen , Elisabeth de Carvalho , Čedomir Stefanović , Petar Popovski

This paper proposes a cell-free massive multiple-input multiple-output (CF-mMIMO) architecture with joint list-based detection with soft interference cancelation (soft-IC) and access points (APs) selection. In particular, we derive a new…

Information Theory · Computer Science 2023-04-11 T. Ssettumba , L. T. N. Landau , R. C. de Lamare

This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al.\ for the unsourced multiple access channel. The original coding scheme features a polar outer code in conjunction with a…

Information Theory · Computer Science 2021-05-31 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

It is a challenging task to design a random access protocol that achieves the optimal throughput in multi-cell random access with decentralized transmission due to the difficulty of coordination. In this paper, we present a decentralized…

Information Theory · Computer Science 2020-06-16 Huifa Lin , Kwang Soon Kim , Won-Yong Shin

To efficiently utilize the scarce wireless resource, the random access scheme has been attaining renewed interest primarily in supporting the sporadic traffic of a large number of devices encountered in the Internet of Things (IoT). In this…

Information Theory · Computer Science 2024-10-24 Dick Maryopi , Daud Al Adumy , Osman Musa , Peter Jung , Agus Virgono

The core requirement of massive Machine-Type Communication (mMTC) is to support reliable and fast access for an enormous number of machine-type devices (MTDs). In many practical applications, the base station (BS) only concerns the list of…

Information Theory · Computer Science 2022-01-03 Jingze Che , Zhaoyang Zhang , Zhaohui Yang , Xiaoming Chen , Caijun Zhong , Derrick Wing Kwan Ng

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

Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this model, coded compressed sensing (CCS) has emerged as a…

Information Theory · Computer Science 2021-07-22 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

Unsourced multiple access abstracts grantless simultaneous communication of a large number of devices (messages) each of which transmits (is transmitted) infrequently. It provides a model for machine-to-machine communication in the Internet…

Signal Processing · Electrical Eng. & Systems 2019-12-13 Robert Calderbank , Andrew Thompson

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

In this work, we propose three pilot assignment schemes to reduce the effect of pilot contamination in cell-free massive multiple-input-multiple-output (MIMO) systems. Our first algorithm, which is based on the idea of random sequential…

Information Theory · Computer Science 2021-05-21 Priyabrata Parida , Harpreet S. Dhillon

In this paper, we introduce Multi-Slots Coded ALOHA (MuSCA) as a multiple random access method for satellite communications. This scheme can be considered as a generalization of the Contention Resolution Diversity Slotted Aloha (CRDSA)…

Information Theory · Computer Science 2015-03-19 Huyen-Chi Bui , Jérôme Lacan , Marie-Laure Boucheret

This paper investigates the unsourced random access (URA) problem for integrated sensing and commutations (ISAC). Recent results reveal that conventional multiple access strategies for ISAC such as treating interference as noise (TIN) and…

Information Theory · Computer Science 2025-09-22 Zhentian Zhang , Kai-Kit Wong , Jian Dang , Zaichen Zhang , Chan-Byoung Chae

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

The problem of uplink transmissions in massive connectivity is commonly dealt with using schemes for grant-free random access. When a large number of devices transmit almost synchronously, the receiver may not be able to resolve the…

Signal Processing · Electrical Eng. & Systems 2024-12-09 Ao Chen , Wei Chen , Bo Ai , Petar Popovski

Non-orthogonal multiple access (NOMA) serves multiple users by superposing their distinct message signals. The desired message signal is decoded at the receiver by applying successive interference cancellation (SIC). Using the theory of…

Information Theory · Computer Science 2016-11-14 Hina Tabassum , Ekram Hossain , Md. Jahangir Hossain

Recently, the so-called cell-free Massive MIMO architecture has been introduced, wherein a very large number of distributed access points (APs) simultaneously and jointly serve a much smaller number of mobile stations (MSs). A variant of…

Information Theory · Computer Science 2017-10-24 Stefano Buzzi , Alessio Zappone

In this paper, we design a novel two-phase unsourced random access (URA) scheme in massive multiple input multiple output (MIMO). In the first phase, we collect a sequence of information bits to jointly acquire the user channel state…

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