English
Related papers

Related papers: A Fully Bayesian Approach for Massive MIMO Unsourc…

200 papers

Unsourced multiple access abstracts grantless simultaneous communication of a large number of devices (messages) each of which transmits (is transmitted) infrequently. It provides a model for machine-to-machine communication in the Internet…

Signal Processing · Electrical Eng. & Systems 2019-12-13 Robert Calderbank , Andrew Thompson

Massive MIMO systems, where base stations are equipped with hundreds of antennas, are an attractive way to handle the rapid growth of data traffic. As the number of user equipments (UEs) increases, the initial access and handover in…

Signal Processing · Electrical Eng. & Systems 2018-06-20 Luca Sanguinetti , Antonio A. D'Amico , Michele Morelli , Merouane Debbah

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

Modern mobile terminals often produce a large number of small data packets. For these packets, it is inefficient to follow the conventional medium access control protocols because of poor utilization of service resources. We propose a novel…

Information Theory · Computer Science 2014-09-05 Ronggui Xie , Huarui Yin , Xiaohui Chen , Zhengdao Wang

In the upcoming Internet-of-Things (IoT) era, the communication is often featured by massive connection, sporadic transmission, and small-sized data packets, which poses new requirements on the delay expectation and resource allocation…

Information Theory · Computer Science 2019-10-17 Zhaoji Zhang , Ying Li , Chongwen Huang , Qinghua Guo , Chau Yuen , Yong Liang Guan

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

This paper gives a replica analysis for the minimum mean square error (MSE) of a massive multiple-input multiple-output (MIMO) system by using Bayesian inference. The Bayes-optimal estimator is adopted to estimate the data symbols and the…

Information Theory · Computer Science 2016-11-15 Chao-Kai Wen , Yongpeng Wu , Kai-Kit Wong , Robert Schober , Pangan Ting

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

We propose regularized approximate message passing (RAMP), a low-complexity algorithm for discrete signal detection in overloaded multiple-input multiple-output (MIMO) systems where the number of transmit antennas exceeds the number of…

Signal Processing · Electrical Eng. & Systems 2026-04-07 Shreesal Shrestha , Getuar Rexhepi , Kuranage Roche Rayan Ranasinghe , Hyeon Seok Rou , Giuseppe Thadeu Freitas de Abreu

This article presents a novel transmission scheme for the unsourced, uncoordinated Gaussian multiple access problem. The proposed scheme leverages notions from single-user coding, random spreading, minimum-mean squared error (MMSE)…

Information Theory · Computer Science 2019-11-05 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

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

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

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

This paper proposes a Bayesian downlink channel estimation algorithm for time-varying massive MIMO networks. In particular, the quantization effects at the receiver are considered. In order to fully exploit the sparsity and time…

Information Theory · Computer Science 2019-05-16 Jianpeng Ma , Shun Zhang , Hongyan Li , Feifei Gao , Zhu Han

This paper considers a low-complexity Gaussian Message Passing Iterative Detection (GMPID) algorithm for Multiple-Input Multiple-Output systems with Non-Orthogonal Multiple Access (MIMO-NOMA), in which a base station with $N_r$ antennas…

Information Theory · Computer Science 2016-07-05 Lei Liu , Chau Yuen , Yong Liang Guan , Ying Li , Chongwen Huang

Grant-free random access (RA) with massive MIMO is a promising RA technique with low signaling overhead that provides significant benefits in increasing the channel reuse efficiency. Since user equipment (UE) detection and channel…

Information Theory · Computer Science 2018-09-21 Hao Jiang , Daiming Qu , Jie Ding , Tao Jiang

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

Sparsity of channel in the next generation of wireless communication for massive multiple-input-multiple-output (MIMO) systems can be exploited to reduce the overhead in the training. The multitask (MT)-sparse Bayesian learning (SBL) is…

Information Theory · Computer Science 2024-10-30 Arash Shahmansoori

This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally…

Information Theory · Computer Science 2018-06-04 Vamsi K. Amalladinne , Avinash Vem , Dileep Kumar Soma , Krishna R. Narayanan , Jean-Francois Chamberland

Sparse Code Multiple Access (SCMA) and Blind Interference Alignment (BIA) are key enablers for multi-user communication, yet each suffers from distinct limitations: SCMA faces high complexity and limited multiplexing gain, while BIA…

Information Theory · Computer Science 2026-03-05 Jianjian Wu , Chi-Tsun Cheng , Qingfeng Zhou , Jianlin Liang , Jinke Wu