English
Related papers

Related papers: Massive Unsourced Random Access: Exploiting Angula…

200 papers

Multi-user spatial modulation (SM) assisted by sparse code multiple access (SCMA) has been recently proposed to provide uplink high spectral efficiency transmission. The message passing algorithm (MPA) is employed to detect the transmitted…

Signal Processing · Electrical Eng. & Systems 2020-08-19 Ibrahim Al-Nahhal , Octavia A. Dobre , Salama Ikki

Massive machine-type communications (mMTC) are poised to provide ubiquitous connectivity for billions of Internet-of-Things (IoT) devices. However, the required low-latency massive access necessitates a paradigm shift in the design of…

Information Theory · Computer Science 2021-08-24 Yikun Mei , Zhen Gao , Yongpeng Wu , Wei Chen , Jun Zhang , Derrick Wing Kwan Ng , Marco Di Renzo

Ranked set sampling (RSS) is a stratified sampling method that improves efficiency over simple random sampling (SRS) by utilizing auxiliary information for ranking and stratification. While balanced RSS (BRSS) assumes equal allocation…

Methodology · Statistics 2025-09-03 Chul Moon , Soohyun Ahn

Sparse code multiple access (SCMA) is one of the most promising methods among all the non-orthogonal multiple access techniques in the future 5G communication. Compared with some other non-orthogonal multiple access techniques such as low…

Signal Processing · Electrical Eng. & Systems 2020-02-28 Fan Wei , Wen Chen

We propose an improvement of the random spreading approach with polar codes for unsourced multiple access. Each user encodes its message by a polar code, and the coded bits are then spread using a random spreading sequence. The proposed…

Information Theory · Computer Science 2021-08-30 Mohammad Javad Ahmadi , Tolga M. Duman

As an emerging communication auxiliary technology, reconfigurable intelligent surface (RIS) is expected to play a significant role in the upcoming 6G networks. Due to its total reflection characteristics, it is challenging to implement…

Signal Processing · Electrical Eng. & Systems 2023-08-04 W. Li , Z. Lin , Q. Guo , B. Vucetic

This paper considers the unsourced random access (URA) problem with a random and unknown number of active users in multiple-input multiple-output (MIMO) quasi-static Rayleigh fading channels. We derive non-asymptotic achievability bounds on…

Information Theory · Computer Science 2025-03-24 Junyuan Gao , Yongpeng Wu , Giuseppe Caire , Wei Yang , H. Vincent Poor , Wenjun Zhang

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

Emerging communication networks are envisioned to support massive wireless connectivity of heterogeneous devices with sporadic traffic and diverse requirements in terms of latency, reliability, and bandwidth. Providing multiple access to an…

Information Theory · Computer Science 2023-04-19 Sajad Daei , Marios Kountouris

Motivated by the analogy between successive interference cancellation and iterative belief-propagation on erasure channels, irregular repetition slotted ALOHA (IRSA) strategies have received a lot of attention in the design of medium access…

Information Theory · Computer Science 2015-01-06 Laura Toni , Pascal Frossard

We consider the approximate support recovery (ASR) task of inferring the support of a $K$-sparse vector ${\bf x} \in \mathbb{R}^n$ from $m$ noisy measurements. We examine the case where $n$ is large, which precludes the application of…

We address the problem of uncoordinated massive random-access in the Gaussian multiple access channel (MAC). The performance of low-complexity T-fold irregular repetition slotted ALOHA (IRSA) scheme is investigated and achievability bounds…

Information Theory · Computer Science 2018-11-20 Anton Glebov , Nikolay Matveev , Kirill Andreev , Alexey Frolov , Andrey Turlikov

This work studies the optimization of rate-splitting multiple access (RSMA) transmission technique for a cloud radio access network (C-RAN) downlink system. Main idea of RSMA is to split the message for each user equipment (UE) to private…

Signal Processing · Electrical Eng. & Systems 2019-07-05 Daesung Yu , Junbeom Kim , Seok-Hwan Park

In the research of next-generation wireless communication technologies, orthogonal time frequency space (OTFS) modulation is emerging as a promising technique for high-speed mobile environments due to its superior efficiency and robustness…

Signal Processing · Electrical Eng. & Systems 2025-04-29 Yanfeng Hu , Dongming Wang , Xinjiang Xia , Jiamin Li , Pengcheng Zhu , Xiaohu You

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

In this paper, we propose a compressive random access (CRA) scheme using multiple resource blocks (RBs) to support massive connections for machine type communications (MTC). The proposed CRA scheme is scalable. As a result, if the number of…

Information Theory · Computer Science 2019-02-28 Jinho Choi

Sparse Code Multiple Access (SCMA) is an enabling code-domain non-orthogonal multiple access (NOMA)scheme for massive connectivity and ultra low-latency in future machine-type communication networks. As an evolved variant of code division…

Information Theory · Computer Science 2021-05-17 Saumya Chaturvedi , Zilong Liu , Vivek Ashok Bohara , Anand Srivastava , Pei Xiao

In massive connectivity scenarios with short packets, of interest is the regime where users share wireless resources in a non-orthogonal fashion. Small payloads combined with sporadic user activation call for approaches that jointly address…

Signal Processing · Electrical Eng. & Systems 2021-01-12 Johannes Dommel , Zoran Utkovski , Petar Popovski , Slawomir Stanczak

This paper considers a general framework for massive random access based on sparse superposition coding. We provide guidelines for the code design and propose the use of constant-weight codes in combination with a dictionary design based on…

Information Theory · Computer Science 2022-07-27 Patrick Agostini , Zoran Utkovski , Alexis Decurninge , Maxime Guillaud , Slawomir Stanczak

Compressive Sensing has been utilized in Cognitive Radio Networks (CRNs) to exploit the sparse nature of the occupation of the primary users. Also, distributed spectrum sensing has been proposed to tackle the wireless channel problems, like…

Information Theory · Computer Science 2016-06-14 Mohamed Seif , Tamer Elbatt , Karim G. Seddik