English
Related papers

Related papers: Matrix Factorization Based Blind Bayesian Receiver…

200 papers

Recently, grant-free random access schemes have received significant attention in the scientific community as a solution for extremely low-latency massive communications in new industrial Internet-of-things (IIoT) and digital twins…

Signal Processing · Electrical Eng. & Systems 2022-12-26 Davide Dardari , Marina Lotti , Nicolò Decarli , Gianni Pasolini

Massive MIMO is a promising technology to enable a massive number of Internet of Things nodes to transmit short and sporadic data bursts at low power. In conventional cellular networks, devices use a grant-based random access scheme to…

Signal Processing · Electrical Eng. & Systems 2022-07-08 Gilles Callebaut , Liesbet Van der Perre , François Rottenberg

Most existing studies on joint activity detection and channel estimation for grant-free massive random access (RA) systems assume perfect synchronization among all active users, which is hard to achieve in practice. Therefore, this paper…

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

Future cellular networks will support a massive number of devices as a result of emerging technologies such as Internet-of-Things and sensor networks. Enhanced by machine type communication (MTC), low-power low-complex devices in the order…

Information Theory · Computer Science 2017-09-18 Kamil Senel , Erik G. Larsson

Support massive connectivity is an important requirement in 5G wireless communication system. For massive Machine Type Communication (MTC) scenario, since the network is expected to accommodate a massive number of MTC devices with sparse…

Information Theory · Computer Science 2017-01-11 Yanlun Wu , Jun Fang

Device activity detection is one main challenge in grant-free random access, which is recently proposed to support massive access for massive machine-type communications (mMTC). Existing solutions fail to consider interference generated by…

Information Theory · Computer Science 2020-02-10 Dongdong Jiang , Ying Cui

In this paper, a novel blind multi-user detection(MUD) framework for autonomous grant-free high-overloading non-orthogonal multiple access is introduced in detail aimed at fulfilling the requirements of fifth-generation massive Machine Type…

Information Theory · Computer Science 2017-12-08 Zhifeng Yuan , Yuzhou Hu , Weimin Li , Jianqiang Dai

This work presents a novel framework for random access in crowded scenarios of multiple-input multiple-output(MIMO) systems. A multi-antenna base station (BS) and multiple single-antenna users are considered in these systems. A huge portion…

Information Theory · Computer Science 2022-04-27 Abolghasem Afshar , Vahid Tabataba Vakili , Sajad Daei

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

We propose a novel generalized framework for grant-free random-access (GFRA) in cell-free massive multiple input multiple-output systems where multiple geographically separated access points (APs) or base stations (BSs) aim to detect…

Signal Processing · Electrical Eng. & Systems 2024-11-20 Sai Subramanyam Thoota , Erik G. Larsson

To realize orthogonal frequency division multiplexing (OFDM)-based grant-free access for wideband systems under frequency-selective fading, existing device activity detection and channel estimation methods need substantial accuracy…

Information Theory · Computer Science 2025-08-12 Zhiyan Li , Ying Cui , Danny H. K. Tsang

We consider unsourced random access (uRA) in a cell-free (CF) user-centric wireless network, where a large number of potential users compete for a random access slot, while only a finite subset is active. The random access users transmit…

Information Theory · Computer Science 2025-05-01 Burak Çakmak , Eleni Gkiouzepi , Manfred Opper , Giuseppe Caire

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

Grant-free multiple-input multiple-output (MIMO) usually employs non-orthogonal pilots for joint user detection and channel estimation. However, existing methods are too complex for massive grant-free access in massive MIMO. This letter…

Information Theory · Computer Science 2020-12-29 Yihua Ma , Zhifeng Yuan , Weimin Li , Zhigang Li

Massive machine-type communications (mMTC) in 6G requires supporting a massive number of devices with limited resources, posing challenges in efficient random access. Grant-free random access and uplink non-orthogonal multiple access (NOMA)…

Information Theory · Computer Science 2023-06-01 Thushan Sivalingam , Samad Ali , Nurul Huda Mahmood , Nandana Rajatheva , Matti Latva Aho

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-08-11 Alexander Fengler , Peter Jung , Giuseppe Caire

Cell-free communication has the potential to significantly improve grant-free transmission in massive machine-type communication, wherein multiple access points jointly serve a large number of user equipments to improve coverage and…

Information Theory · Computer Science 2023-08-29 Gangle Sun , Mengyao Cao , Wenjin Wang , Wei Xu , Christoph Studer

The massiveness of devices in crowded Machine-to-Machine (M2M) communications brings new challenges to existing random-access (RA) schemes, such as heavy signaling overhead and severe access collisions. In order to reduce the signaling…

Information Theory · Computer Science 2019-10-09 Zhaoji Zhang , Ying Li , Lei Liu , Wei Hou

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

We consider an extension of the massive unsourced random access originally proposed by Polyanskiy to the case where the receiver has a very large number of antennas (a massive MIMO base station) and no channel state information is given to…

Information Theory · Computer Science 2019-01-04 Alexander Fengler , Giuseppe Caire , Peter Jung , Saeid Haghighatshoar