English
Related papers

Related papers: Sparse IDMA: A Joint Graph-Based Coding Scheme for…

200 papers

This article presents a novel transmission scheme for the unsourced, uncoordinated Gaussian multiple access problem. The proposed scheme leverages notions from single-user coding, random spreading, minimum-mean squared error (MMSE)…

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

This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally…

Information Theory · Computer Science 2018-06-04 Vamsi K. Amalladinne , Avinash Vem , Dileep Kumar Soma , Krishna R. Narayanan , Jean-Francois Chamberland

This paper addresses the unsourced/uncoordinated random access problem in an integrated sensing and communications (ISAC) system, with a focus on uplink multiple access code design. Recent theoretical advancements highlight that an ISAC…

Information Theory · Computer Science 2025-04-25 Zhentian Zhang , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

In this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a…

Information Theory · Computer Science 2025-05-06 Zhentian Zhang , Mohammad Javad Ahmadi , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

This article introduces a novel communication scheme, termed coded compressed sensing, for unsourced multiple-access communication. The proposed divide-and-conquer approach leverages recent advances in compressed sensing and forward error…

Signal Processing · Electrical Eng. & Systems 2019-06-26 Vamsi K. Amalladinne , Jean-Francois Chamberland , Krishna R. Narayanan

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

In this paper, we propose a new polar coding scheme for the unsourced, uncoordinated Gaussian random access channel. Our scheme is based on sparse spreading, treat interference as noise and successive interference cancellation (SIC). On the…

Information Theory · Computer Science 2020-07-14 Mengfan Zheng , Yongpeng Wu , Wenjun Zhang

We investigate the unsourced random access scheme assuming that the base station is equipped with multiple antennas, and propose a high-performing solution utilizing on-off-division multiple access. We assume that each user spreads its…

Information Theory · Computer Science 2024-06-11 Mert Ozates , Mohammad Kazemi , Tolga M. Duman

Massive communication is one of key scenarios of 6G where two magnitude higher connection density would be required to serve diverse services. As a promising direction, unsourced multiple access has been proved to outperform significantly…

Information Theory · Computer Science 2024-11-18 Yifei Yuan , Yuhong Huang , Chunlin Yan , Sen Wang , Shuai Ma , Xiaodong Shen

This work considers the problem of integrated sensing and communications (ISAC) with a massive number of unsourced and uncoordinated users. In the proposed model, known as the unsourced ISAC system (UNISAC), all active communication and…

Information Theory · Computer Science 2026-04-21 Mohammad Javad Ahmadi , Rafael F. Schaefer , H. Vincent Poor

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

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

This paper deals with the problem of massive random access for Gaussian multiple access channel (MAC). We continue to investigate the coding scheme for Gaussian MAC proposed by A. Vem et al in 2017. The proposed scheme consists of four…

Information Theory · Computer Science 2018-03-23 Luiza Medova , Anton Glebov , Pavel Rybin , Alexey Frolov

We consider the unsourced random access problem with multiple receivers and propose a cell-free type solution for that. In our proposed scheme, the active users transmit their signals to the access points (APs) distributed in a geographical…

Emerging Technologies · Computer Science 2025-01-20 Mert Ozates , Mohammad Kazemi , Eduard Jorswieck , Deniz Gunduz

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

Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced access with coded compressed sensing (CCS), as first pointed…

Information Theory · Computer Science 2020-01-14 Vamsi K. Amalladinne , Asit Kumar Pradhan , Cynthia Rush , Jean-Francois Chamberland , Krishna R. Narayanan

We put forward a new algorithmic solution to the massive unsourced random access (URA) problem, by leveraging the rich spatial dimensionality offered by large-scale antenna arrays. This paper makes an observation that spatial signature is…

Information Theory · Computer Science 2020-09-16 Volodymyr Shyianov , Faouzi Bellili , Amine Mezghani , Ekram Hossain

This paper investigates the unsourced random access (URA) problem with a massive multiple-input multiple-output receiver that serves wireless devices in the near-field of radiation. We employ an uncoupled transmission protocol without…

Information Theory · Computer Science 2024-01-26 Xinyu Xie , Yongpeng Wu , Jianping An , Derrick Wing Kwan Ng , Chengwen Xing , Wenjun Zhang

Sparse regression codes with approximate message passing (AMP) decoding have gained much attention in recent times. The concepts underlying this coding scheme extend to unsourced random access with coded compressed sensing (CCS), as first…

Information Theory · Computer Science 2020-10-12 Vamsi K. Amalladinne , Asit Kumar Pradhan , Cynthia Rush , Jean-Francois Chamberland , Krishna R. Narayanan

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
‹ Prev 1 2 3 10 Next ›