English
Related papers

Related papers: A Fully Asynchronous Unsourced Random Access Schem…

200 papers

This article introduces a novel communication paradigm for the unsourced, uncoordinated Gaussian multiple access problem. The major components of the envisioned framework are as follows. The encoded bits of every message are partitioned…

Information Theory · Computer Science 2020-11-23 Asit Pradhan , Vamsi Amalladinne , Avinash Vem , Krishna R. Narayanan , Jean-Francois Chamberland

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

Massive Machine-Type Communications (mMTC) features a massive number of low-cost user equipments (UEs) with sparse activity. Tailor-made for these features, grant-free random access (GF-RA) serves as an efficient access solution for mMTC.…

Information Theory · Computer Science 2023-05-18 Zhaoji Zhang , Yuhao Chi , Qinghua Guo , Ying Li , Guanghui Song , Chongwen Huang

Space-Division Multiple Access (SDMA) utilizes linear precoding to separate users in the spatial domain and relies on fully treating any residual multi-user interference as noise. Non-Orthogonal Multiple Access (NOMA) uses linearly precoded…

Information Theory · Computer Science 2018-11-22 Yijie Mao , Bruno Clerckx , Victor O. K. Li

In this paper, we investigate a joint device activity detection (DAD), channel estimation (CE), and data decoding (DD) algorithm for multiple-input multiple-output (MIMO) massive unsourced random access (URA). Different from the…

Information Theory · Computer Science 2021-12-20 Tianya Li , Yongpeng Wu , Mengfan Zheng , Wenjun Zhang , Chengwen Xing , Jianping An , Xiang-Gen Xia , Chengshan Xiao

Rateless Multiple Access (RMA) is a novel non-orthogonal multiple access framework that is promising for massive access in Internet of Things (IoT) due to its high efficiency and low complexity. In the framework, after certain…

Information Theory · Computer Science 2016-11-17 Zhaoyang Zhang , Xianbin Wang , Yu Zhang , Yan Chen

Rate-Splitting Multiple Access (RSMA) has emerged as a powerful multiple access, interference management, and multi-user strategy for next generation communication systems. In this tutorial, we depart from the orthogonal multiple access…

Information Theory · Computer Science 2023-01-11 Bruno Clerckx , Yijie Mao , Eduard A. Jorswieck , Jinhong Yuan , David J. Love , Elza Erkip , Dusit Niyato

This paper investigates the problem of resource allocation for joint communication and radar sensing system on rate-splitting multiple access (RSMA) based unmanned aerial vehicle (UAV) system. UAV simultaneously communicates with multiple…

Information Theory · Computer Science 2021-07-13 Yuwei Li , Wanli Ni , Hui Tian , Meihui Hua , Shaoshuai Fan

This paper investigates the multiple-input-multiple-output (MIMO) massive unsourced random access in an asynchronous orthogonal frequency division multiplexing (OFDM) system, with both timing and frequency offsets (TFO) and non-negligible…

Information Theory · Computer Science 2023-08-21 Tianya Li , Yongpeng Wu , Wenjun Zhang , Xiang-Gen Xia , Chengshan Xiao

In this paper, pattern division multiple access with large-scale antenna array (LSA-PDMA) is proposed as a novel non-orthogonal multiple access (NOMA) scheme. In the proposed scheme, pattern is designed in both beam domain and power domain…

Information Theory · Computer Science 2017-03-22 Peng Li , Yanxiang Jiang , Shaoli Kang , Fuchun Zheng , Xiaohu You

Hybrid non-orthogonal multiple access (NOMA) has recently received significant research interest due to its ability to efficiently use resources from different domains and also its compatibility with various orthogonal multiple access (OMA)…

Information Theory · Computer Science 2024-07-08 Zhiguo Ding , H. Vincent Poor

In this paper, coded slotted ALOHA (CSA) is introduced as a powerful random access scheme to the MAC frame. In CSA, the burst a generic user wishes to transmit in the MAC frame is first split into segments, and these segments are then…

Information Theory · Computer Science 2016-11-18 Enrico Paolini , Gianluigi Liva , Marco Chiani

Rate-splitting multiple access (RSMA) is a multiple access technique generalizing conventional techniques, such as, space-division multiple access (SDMA), non-orthogonal multiple access (NOMA), and physical layer multi-casting, which aims…

Information Theory · Computer Science 2023-09-26 Mehmet Mert Sahin , Onur Dizdar , Bruno Clerckx , Huseyin Arslan

This paper investigates the energy efficiency of massive unsourced random access~(URA) in multiple-input multiple-output quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum…

Information Theory · Computer Science 2023-02-07 Junyuan Gao , Yongpeng Wu , Tianya Li , Wenjun Zhang

The problem of uplink transmissions in massive connectivity is commonly dealt with using schemes for grant-free random access. When a large number of devices transmit almost synchronously, the receiver may not be able to resolve the…

Signal Processing · Electrical Eng. & Systems 2024-12-09 Ao Chen , Wei Chen , Bo Ai , Petar Popovski

Existing work that schedules concurrent transmissions collision-free suffers from low channel utilization. We propose the Optimal Node Activation Multiple Access (ONAMA) protocol to achieve maximal channel spatial reuse through a…

Networking and Internet Architecture · Computer Science 2014-04-02 Xiaohui Liu , Hongwei Zhang

An asynchronous $\ka$-active-user unsourced multiple access channel (AUMAC) is a key model for uncoordinated massive access in future networks. We focus on a scenario where each transmission is subject to the maximal delay constraint…

Information Theory · Computer Science 2025-01-28 Jyun-Sian Wu , Pin-Hsun Lin , Marcel A. Mross , Eduard A. Jorswieck

In this paper, an improved ALOHA-based unsourced random access (URA) scheme is proposed in MIMO channels. The channel coherent interval is divided into multiple sub-slots and each active user selects several sub-slots to send its codeword,…

Information Theory · Computer Science 2025-05-06 Linjie Yang , Pingzhi Fan , Zhiguo Ding , Jingqiu Gao

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

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