English
Related papers

Related papers: Massive Unsourced Random Access: Exploiting Angula…

200 papers

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

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

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

Unsourced random access (URA) is a recently proposed multiple access paradigm tailored to the uplink channel of machine-type communication networks. By exploiting a strong connection between URA and compressed sensing, the massive multiple…

Information Theory · Computer Science 2022-06-28 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

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

Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of…

Information Theory · Computer Science 2021-12-10 Alexander Fengler , Peter Jung , Giuseppe Caire

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

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

Unsourced random-access (U-RA) is a type of grant-free random access with a virtually unlimited number of users, of which only a certain number $K_a$ are active on the same time slot. Users employ exactly the same codebook, and the task of…

Information Theory · Computer Science 2021-01-11 Alexander Fengler , Peter Jung , Giuseppe Caire

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

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

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

This paper considers an unsourced random access (URA) set-up equipped with a passive reconfigurable intelligent surface (RIS), where a massive number of unidentified users (only a small fraction of them being active at any given time) are…

Information Theory · Computer Science 2024-08-27 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman

Unsourced random access (URA) is a particular form of grant-free uncoordinated random access wherein the users' identities are not associated to specific waveforms at the physical layer. Tensor-based modulation (TBM) has been recently…

Signal Processing · Electrical Eng. & Systems 2023-04-25 Alberto Rech , Alexis Decurninge , Luis G. Ordóñez

In this paper, we explore an efficient uncoupled unsourced random access (UURA) scheme for 6G massive communication. UURA is a typical framework of unsourced random access that addresses the problems of codeword detection and message…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Chongwen Huang , Zhaoyang Zhang

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 investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…

Information Theory · Computer Science 2020-09-15 Xinyu Xie , Yongpeng Wu , Junyuan Gao , Wenjun Zhang

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

Information Theory · Computer Science 2023-07-17 Mohammad Javad Ahmadi , Mohammad Kazemi , Tolga M. Duman
‹ Prev 1 2 3 10 Next ›