English
Related papers

Related papers: Type-Based Unsourced Multiple Access over Fading C…

200 papers

This paper is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated…

Information Theory · Computer Science 2024-08-20 Gianluigi Liva , Yury Polyanskiy

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

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

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

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 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 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 paper proposes a novel multiple-access framework, termed the phased ultra massive antenna array (PUMA), which exploits the distinctive spatial flexibility of fluid antenna systems (FAS) at the user equipment (UE). Building upon fluid…

Information Theory · Computer Science 2026-05-07 Hanjiang Hong , Kai-Kit Wong , Xusheng Zhu , Chenguang Rao , Dazhi He , Hyundong Shin

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce…

Information Theory · Computer Science 2022-02-17 Xinyu Xie , Yongpeng Wu , Jianping An , Junyuan Gao , Wenjun Zhang , Chengwen Xing , Kai-Kit Wong , Chengshan Xiao

Non-orthogonal multiple access (NOMA) is a key technology to enable massive machine type communications (mMTC) in 5G networks and beyond. In this paper, NOMA is applied to improve the random access efficiency in high-density…

Networking and Internet Architecture · Computer Science 2024-10-28 Sami Khairy , Prasanna Balaprakash , Lin X. Cai , H. Vincent Poor

We propose a novel multiple-access technique to overcome the shortcomings of the current proposals for the future releases of Long-Term Evolution (LTE). We provide a unified radio access system that efficiently and flexibly integrates both…

Information Theory · Computer Science 2016-09-16 Nassar Ksairi , Stefano Tomasin , Mérouane Debbah

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

Non-orthogonal multiple access (NoMA) as an efficient way of radio resource sharing can root back to the network information theory. For generations of wireless communication systems design, orthogonal multiple access (OMA) schemes in time,…

Future mobile communication networks will require enhanced network efficiency and reduced system overhead. Research on Blind Interference Alignment and Topological Interference Management (TIM) has shown that optimal Degrees of Freedom can…

Information Theory · Computer Science 2015-08-18 V. Kalokidou , O. Johnson , R. Piechocki

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…

Information Theory · Computer Science 2022-03-09 Michail Gkagkos , Krishna R. Narayanan , Jean-Francois Chamberland , Costas N. Georghiades

One of the key requirements for fifth-generation (5G) cellular networks is their ability to handle densely connected devices with different quality of service (QoS) requirements. In this article, we present multi-service oriented multiple…

Information Theory · Computer Science 2016-05-04 Nassar Ksairi , Stefano Tomasin , Mérouane Debbah

Compact ultra-massive antenna-array (CUMA) is a novel multiple access technology built on the fluid antenna system (FAS) concept, offering an improved scheme over fluid antenna multiple access (FAMA) that can support massive connectivity on…

Signal Processing · Electrical Eng. & Systems 2025-09-25 Chenguang Rao , Kai-Kit Wong , Mohd Hamza Naim Shaikh , Hanjiang Hong , Hyundong Shin , Yangyang Zhang

This paper proposes a tractable solution for integrating non-orthogonal multiple access (NOMA) into massive machine-type communications (mMTC) to increase the uplink connectivity. Multiple transmit power levels are provided at the user end…

Information Theory · Computer Science 2020-11-26 Wenqiang Yi , Wenjuan Yu , Yuanwei Liu , Chuan Heng Foh , Zhiguo Ding , Arumugam Nallanathan

We consider an extension of the massive unsourced random access originally proposed by Polyanskiy to the case where the receiver has a very large number of antennas (a massive MIMO base station) and no channel state information is given to…

Information Theory · Computer Science 2019-01-04 Alexander Fengler , Giuseppe Caire , Peter Jung , Saeid Haghighatshoar