English
Related papers

Related papers: Massive MIMO Unsourced Random Access

200 papers

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 consider the problem of unsourced random access (U-RA), a grant-free uncoordinated form of random access, in a wireless channel with a massive MIMO base station equipped with a large number $M$ of antennas and a large number of wireless…

Information Theory · Computer Science 2020-05-21 Alexander Fengler , Saeid Haghighatshoar , Peter Jung , Giuseppe Caire

In this paper, we study the problem of user activity detection and large-scale fading coefficient estimation in a random access wireless uplink with a massive MIMO base station with a large number $M$ of antennas and a large number of…

Information Theory · Computer Science 2021-09-22 Alexander Fengler , Saeid Haghighatshoar , Peter Jung , Giuseppe Caire

This paper considers the massive MIMO unsourced random access problem in a quasi-static Rayleigh fading setting. The proposed coding scheme is based on a concatenation of a "conventional" channel code (such as, e.g., LDPC) serving as an…

Signal Processing · Electrical Eng. & Systems 2023-05-01 Patrick Agostini , Zoran Utkovski , Slawomir Stanczak

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

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 extend the seminal work by Polyanskiy (2017) on massive uncoordinated access to the case where the number of active users is random and unknown a priori. We define a random-access code accounting for both misdetection (MD) and false…

Information Theory · Computer Science 2022-02-15 Khac-Hoang Ngo , Alejandro Lancho , Giuseppe Durisi , Alexandre Graell i Amat

In the massive machine-type communication (mMTC) scenario, a large number of devices with sporadic traffic need to access the network on limited radio resources. While grant-free random access has emerged as a promising mechanism for…

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

In this work we treat the unsourced random access problem on a Rayleigh block-fading AWGN channel with multiple receive antennas. Specifically, we consider the slowly fading scenario where the coherence block-length is large compared to the…

Information Theory · Computer Science 2021-09-22 Alexander Fengler , Osman Musa , Peter Jung , Giuseppe Caire

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

In this paper, we investigate an unsourced random access scheme for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks with sporadic data traffic. Firstly, we establish a general framework for massive…

Information Theory · Computer Science 2022-03-01 Feiyan Tian , Xiaoming Chen , Lei Liu , Derrick Wing Kwan Ng

We consider unsourced random access with MIMO receiver - a crucial communication scenario for future 5G/6G wireless networks. We perform a projection-based decoder analysis and derive energy efficiency achievability bounds when channel…

Information Theory · Computer Science 2023-03-28 Kirill Andreev , Daria Ustinova , Alexey Frolov

In this paper, we propose a novel fully Bayesian approach for the massive multiple-input multiple-output (MIMO) massive unsourced random access (URA). The payload of each user device is coded by the sparse regression codes (SPARCs) without…

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

The multiple access channel (MAC) with many-user is a general model for massive machine type communications. In this paradigm, the number of users may be comparable or even larger than the coding blocklength $n$. In contrast, classical MAC…

Information Theory · Computer Science 2019-08-12 Fan Wei , Yongpeng Wu , Wen Chen , Yanlin Geng , Giuseppe Caire

Massive access is one of the main use cases of beyond 5G (B5G) wireless networks and massive MIMO is a key technology for supporting it. Prior works studied massive access in the co-located massive MIMO framework. In this paper, we…

Information Theory · Computer Science 2021-05-24 Unnikrishnan Kunnath Ganesan , Emil Björnson , Erik G. Larsson

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

Information Theory · Computer Science 2016-05-04 Luca Sanguinetti , Antonio A. D'Amico , Michele Morelli , Merouane Debbah

We consider large MIMO systems, where by `{\em large}' we mean number of transmit and receive antennas of the order of tens to hundreds. Such large MIMO systems will be of immense interest because of the very high spectral efficiencies…

Information Theory · Computer Science 2008-04-08 K. Vishnu Vardhan , Saif K. Mohammed , A. Chockalingam , B. Sundar Rajan

In this paper, we investigate unsourced random access for massive machine-type communications (mMTC) in the sixth-generation (6G) wireless networks. Firstly, we establish a high-efficiency uncoupled framework for massive unsourced random…

Information Theory · Computer Science 2024-05-07 Feiyan Tian , Xiaoming Chen , Yong Liang Guan , Chau Yuen

Consider a random access communication scenario over a channel whose operation is defined for any number of possible transmitters. As in the model recently introduced by Polyanskiy for the Multiple Access Channel (MAC) with a fixed, known…

Information Theory · Computer Science 2021-03-19 Recep Can Yavas , Victoria Kostina , Michelle Effros

The spatial diversity and multiplexing advantages of massive multi-input-multi-output (mMIMO) can significantly improve the capacity of massive non-orthogonal multiple access (NOMA) in machine type communications. However, state-of-the-art…

Signal Processing · Electrical Eng. & Systems 2025-02-17 Yueqing Wang , Yikun Mei , Zhen Gao , Ziwei Wan , Boyu Ning , De Mi , Sami Muhaidat
‹ Prev 1 2 3 10 Next ›