English
Related papers

Related papers: Unsourced Random Access With Tensor-Based and Cohe…

200 papers

The unsourced random access (URA) has emerged as a viable scheme for supporting the massive machine-type communications (mMTC) in the sixth generation (6G) wireless networks. Notably, the tensor-based URA (TURA), with its inherent tensor…

Signal Processing · Electrical Eng. & Systems 2024-10-23 Jiaqi Fang , Yan Liang , Gangle Sun , Hongwei Hou , Yafei Wang , Li You , Wenjin Wang

We study the problem of unsourced random access (URA) over Rayleigh block-fading channels with a receiver equipped with multiple antennas. We employ multiple stages of orthogonal pilots, each of which is randomly picked from a codebook. In…

Information Theory · Computer Science 2022-05-20 Mohammad Javad Ahmadi , Tolga M. Duman

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

Current wireless networks are designed to optimize spectral efficiency for human users, who typically require sustained connections for high-data-rate applications like file transfers and video streaming. However, these networks are…

Information Theory · Computer Science 2025-09-30 Kirill Andreev , Pavel Rybin , Alexey Frolov

We investigate fully asynchronous unsourced random access (URA), and propose a high-performing scheme that employs on-off division multiple access (ODMA). In this scheme, active users distribute their data over the transmit block based on a…

Signal Processing · Electrical Eng. & Systems 2025-04-16 Mert Ozates , Mohammad Kazemi , Gianluigi Liva , Deniz Gündüz

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

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

Multiple access communication systems enable numerous users to share common communication resources, playing a crucial role in wireless networks. With the emergence of the sixth generation (6G) and beyond communication networks, supporting…

Information Theory · Computer Science 2025-11-17 Mert Ozates , Mohammad Javad Ahmadi , Mohammad Kazemi , Deniz Gündüz , Tolga M. Duman

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 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

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

We introduce a modulation for unsourced massive random access whereby the transmitted symbols are rank-1 tensors constructed from Grassmannian sub-constellations. The use of a low-rank tensor structure, together with tensor decomposition in…

Information Theory · Computer Science 2020-08-13 Alexis Decurninge , Ingmar Land , Maxime Guillaud

We consider an unsourced random access (URA) system enhanced with a feedback mechanism that serves both communication and sensing tasks. While traditional URA systems do not incorporate feedback, we propose a novel feedback signal design…

Information Theory · Computer Science 2025-06-26 Mohammad Javad Ahmadi , Mohammad Kazemi , Rafael F. Schaefer

Unsourced random access (URA) has emerged as a candidate paradigm for massive machine-type communication (MTC) in next-generation wireless networks. While many excellent uplink schemes have been developed for URA, these schemes do not…

Information Theory · Computer Science 2022-06-06 Jamison R. Ebert , Krishna R. Narayanan , Jean-Francois Chamberland

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

This work introduces security for unsourced random access (URA) by employing physical layer security techniques. To achieve confidentiality, the proposed system opportunistically exploits intrinsic features of feedback-aided URA without…

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

Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures are often employed to ensure that the central base station can accurately recover…

Information Theory · Computer Science 2021-12-02 Vamsi K. Amalladinne , Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

Massive machine-type communications (mMTC) or massive access is a critical scenario in the fifth generation (5G) and the future cellular network. With the surging density of devices from millions to billions, unique pilot allocation becomes…

Information Theory · Computer Science 2025-04-03 Zhentian Zhang , Jian Dang , Zaichen Zhang , Liang Wu , Bingcheng Zhu , Lei Wang

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

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