English
Related papers

Related papers: Grant-Free Massive Random Access With a Massive MI…

200 papers

We consider the unsourced random access problem with multiple receivers and propose a cell-free type solution for that. In our proposed scheme, the active users transmit their signals to the access points (APs) distributed in a geographical…

Emerging Technologies · Computer Science 2025-01-20 Mert Ozates , Mohammad Kazemi , Eduard Jorswieck , Deniz Gunduz

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

A high success rate of grant-free random access scheme is proposed to support massive access for machine-to-machine communications in massive multipleinput multiple-output systems. This scheme allows active user equipments (UEs) to transmit…

Information Theory · Computer Science 2020-12-29 Huimei Han , Lushun Fang , Weidang Lu , Wenchao Zhai , Ying Li , Jun Zhao

Unsourced random access (URA) is a recently proposed communication paradigm attuned to machine-driven data transfers. In the original URA formulation, all the active devices share the same number of bits per packet. The scenario where…

Information Theory · Computer Science 2021-02-16 Vamsi K. Amalladinne , Allen Hao , Stefano Rini , Jean-Francois Chamberland

This paper investigates asynchronous multiple-input multiple-output (MIMO) massive unsourced random access (URA) in an orthogonal frequency division multiplexing (OFDM) system over frequency-selective fading channels, with the presence of…

Information Theory · Computer Science 2024-10-24 Tianya Li , Yongpeng Wu , Junyuan Gao , Wenjun Zhang , Xiang-Gen Xia , Derrick Wing Kwan Ng , Chengshan Xiao

Modern wireless networks must reliably support a wide array of connectivity demands, encompassing various user needs across diverse scenarios. Machine-Type Communication (mMTC) is pivotal in these networks, particularly given the challenges…

Machine Learning · Computer Science 2024-06-12 Ali Elkeshawy , HaÏfa Farès , Amor Nafkha

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

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

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

In this work, we discuss the problem of unsourced random access (URA) over a Gaussian multiple access channel (GMAC). To address the challenges posed by emerging massive machine-type connectivity, URA reframes multiple access as a…

Information Theory · Computer Science 2025-05-06 Zhentian Zhang , Mohammad Javad Ahmadi , Jian Dang , Kai-Kit Wong , Zaichen Zhang , Christos Masouros

Type-based unsourced multiple access (TUMA) is a recently proposed framework for type-based estimation in massive uncoordinated access networks. We extend the existing design of TUMA, developed for an additive white Gaussian channel, to a…

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

Extra-large massive multiple-input multiple-output (XL-MIMO) systems is a new concept, where spatial non-stationarities allow activate a high number of user equipments (UEs). This paper focuses on a grant-based random access (RA) approach…

Signal Processing · Electrical Eng. & Systems 2020-09-08 Otávio Seidi Nishimura , José Carlos Marinello Filho , Taufik Abrão

Grant-free access schemes are candidates to support future massive multiple access applications owing to their capability to reduce control signaling and latency. As a promising class of grant-free schemes, coded random access schemes can…

Information Theory · Computer Science 2022-08-25 Lorenzo Valentini , Marco Chiani , Enrico Paolini

Grant-free access (GFA) has been envisioned to play an active role in massive Machine Type Communication (mMTC) under 5G and Beyond mobile systems, which targets at achieving significant reduction of signaling overhead and access latency in…

Information Theory · Computer Science 2024-01-11 Haoran Mei , Limei Peng , Pin-Han Ho

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

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

Identification and authentication are two basic functionalities of traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is…

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

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

To support machine-type communication (MTC), massive multiple-input multiple-output (MIMO) has been considered for grant-free random access. In general, the performance of grant-free random access with massive MIMO is limited by the number…

Information Theory · Computer Science 2020-09-03 Jinho Choi