English
Related papers

Related papers: Pilot-Based Unsourced Random Access with a Massive…

200 papers

We consider a classical multiple access system with a single transmission channel, finite number of users (users), and randomized transmission protocol (ALOHA). We assume that every user sends messages to the base station with various…

Information Theory · Computer Science 2022-05-04 Dmitriy Kim , Georgi Georgiev , Natalya Markovskaya

Training-based transmission over Rayleigh block-fading multiple-input multiple-output (MIMO) channels is investigated. As a training method a combination of a pilot-assisted scheme and a biased signaling scheme is considered. The achievable…

Information Theory · Computer Science 2016-11-18 Keigo Takeuchi , Ralf R. Mueller , Mikko Vehkaperae , Toshiyuki Tanaka

In this work, we present the design for both pilot-uncoupled and pilot-free on-off multiple access (ODMA) receivers in unsourced random access (URA) for multiple-input multiple-output (MIMO) systems. Unlike pilot-coupled ODMA, where on-off…

Information Theory · Computer Science 2025-05-26 Zhentian Zhang , Jian Dang , Zaichen Zhang

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

Individual links in a wireless network may experience unequal fading coherence times due to differences in mobility or scattering environment, a practical scenario where the fundamental limits of communication have been mostly unknown. This…

Information Theory · Computer Science 2016-07-26 Mohamed Fadel , Aria Nosratinia

The construction of preamble sequences for channel estimation by superposition of orthogonal pilots can improve performance of massive grant-free uplink from machine-type devices. In this letter, a technique is proposed to obtain full…

Information Theory · Computer Science 2023-12-25 Lorenzo Valentini , Elena Bernardi , Enrico Paolini

We consider the problem of type estimation over unsourced multiple access fading channels in distributed multiple-input multiple-output (D-MIMO) systems. Unlike classical unsourced multiple access, type-based unsourced multiple access…

Information Theory · Computer Science 2026-03-03 Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi , Erik G. Ström

We consider a problem of unsourced random access in the quasi-static Rayleigh fading channel. In the previous work, the authors have proposed LDPC code based solutions based on joint and treat interference as noise in combination with…

Information Theory · Computer Science 2020-05-15 Kirill Andreev , Evgeny Marshakov , Alexey Frolov

Radio access management plays a vital role in delay and energy consumption of connected devices. The radio access in existing cellular networks is unable to efficiently support massive connectivity, due to its signaling overhead. In this…

Information Theory · Computer Science 2017-09-08 Amin Azari , Petar Popovski , Guowang Miao , Cedomir Stefanovic

In this paper, we design a novel two-phase unsourced random access (URA) scheme in massive multiple input multiple output (MIMO). In the first phase, we collect a sequence of information bits to jointly acquire the user channel state…

Information Theory · Computer Science 2023-06-28 Jia-Cheng Jiang , Hui-Ming Wang

We study a multiple-input multiple-output (MIMO) multiple access channel (MAC) from several multi-antenna transmitters to a multi-antenna receiver. The fading channels between the transmitters and the receiver are modeled by random…

Information Theory · Computer Science 2011-05-04 Jakob Hoydis , Romain Couillet , Merouane Debbah

The wireless channel changes continuously with time and frequency and the block-fading assumption, which is popular in many theoretical analyses, never holds true in practical scenarios. This discrepancy is critical for user activity…

Information Theory · Computer Science 2024-10-23 Jianan Bai , Erik G. Larsson

In this paper, we consider uplink transmissions involving multiple users communicating with a base station over a fading channel. We assume that the base station does not coordinate the transmissions of the users and hence the users employ…

Computer Science and Game Theory · Computer Science 2009-08-25 Nitin Salodkar , Abhay Karandikar

We investigate the problem of message transmission and the problem of common randomness (CR) generation over single-user multiple-input multiple-output (MIMO) slow fading channels with average input power constraint, additive white Gaussian…

Information Theory · Computer Science 2022-10-24 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel…

Information Theory · Computer Science 2013-05-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

There is an increasing demand of massive machine-type communication (mMTC) to provide scalable access for a large number of devices, which has prompted extensive investigation on grant-free massive random access (RA) in 5G and beyond…

Signal Processing · Electrical Eng. & Systems 2023-04-13 Xinyu Bian , Yuyi Mao , Jun Zhang

Cell-Free Massive MIMO systems aim to expand the coverage area of wireless networks by replacing a single high-performance Access Point (AP) with multiple small, distributed APs connected to a Central Processing Unit (CPU) through a…

Information Theory · Computer Science 2023-11-13 Michail Gkagkos , Jean-Francois Chamberland , Costas N. Georghiades , Krishna R. Narayanan

Unsourced random access is a novel communication paradigm designed for handling a large number of uncoordinated users that sporadically transmit very short messages. Under this model, coded compressed sensing (CCS) has emerged as a…

Information Theory · Computer Science 2021-07-22 Jamison R. Ebert , Vamsi K. Amalladinne , Stefano Rini , Jean-Francois Chamberland , Krishna R. Narayanan

Resource allocation and multiple access schemes are instrumental for the success of communication networks, which facilitate seamless wireless connectivity among a growing population of uncoordinated and non-synchronized users. In this…

Signal Processing · Electrical Eng. & Systems 2023-06-22 Sajad Daei , Saeed Razavikia , Marios Kountouris , Mikael Skoglund , Gabor Fodor , Carlo Fischione