English
Related papers

Related papers: Asynchronous Random Access in Massive MIMO Systems…

200 papers

Massive MIMO systems, where the base stations are equipped with hundreds of antenna elements, are an attractive way to attain unprecedented spectral efficiency in future wireless networks. In the "classical" massive MIMO setting, the…

Information Theory · Computer Science 2016-06-08 Elisabeth de Carvalho , Emil Bjornson , Erik G. Larsson , Petar Popovski

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

A massive MIMO system, represented by a base station with hundreds of antennas, is capable of spatially multiplexing many devices and thus naturally suited to serve dense crowds of wireless devices in emerging applications, such as…

Information Theory · Computer Science 2017-09-06 Elisabeth de Carvalho , Emil Björnson , Jesper H. Sørensen , Erik G. Larsson , Petar Popovski

This paper investigates the unsourced random access (URA) problem with a massive multiple-input multiple-output receiver that serves wireless devices in the near-field of radiation. We employ an uncoupled transmission protocol without…

Information Theory · Computer Science 2024-01-26 Xinyu Xie , Yongpeng Wu , Jianping An , Derrick Wing Kwan Ng , Chengwen Xing , Wenjun Zhang

Despite being the subject of a growing body of research, non-orthogonal multiple access has failed to garner sufficient support to be included in modern standards. One of the more promising approaches to non-orthogonal multiple access is…

Signal Processing · Electrical Eng. & Systems 2024-10-28 Dylan Wheeler , Erin E. Tripp , Balasubramaniam Natarajan

Massive machine-type communications protocols have typically been designed under the assumption that coordination between users requires significant communication overhead and is thus impractical. Recent progress in efficient activity…

Information Theory · Computer Science 2022-07-12 Justin Kang , Wei Yu

In practical cell-free (CF) massive multiple-input multiple-output (MIMO) networks with distributed and low-cost access points, the asynchronous arrival of signals at the user equipments increases multi-user interference that degrades the…

Information Theory · Computer Science 2022-12-07 Jiakang Zheng , Jiayi Zhang , Julian Cheng , Victor C. M. Leung , Derrick Wing Kwan Ng , Bo Ai

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

This paper investigates the unsourced random access (URA) scheme to accommodate numerous machine-type users communicating to a base station equipped with multiple antennas. Existing works adopt a slotted transmission strategy to reduce…

Information Theory · Computer Science 2022-02-17 Xinyu Xie , Yongpeng Wu , Jianping An , Junyuan Gao , Wenjun Zhang , Chengwen Xing , Kai-Kit Wong , Chengshan Xiao

In future wireless networks, one fundamental challenge for massive machine-type communications (mMTC) lies in the reliable support of massive connectivity with low latency. Against this background, this paper proposes a compressive sensing…

Information Theory · Computer Science 2018-09-13 Malong Ke , Zhen Gao , Yongpeng Wu , Xiangming Meng

We study a delay-constrained grant-free random access system with a multi-antenna base station. The users randomly generate data packets with expiration deadlines, which are then transmitted from data queues on a first-in first-out basis.…

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

Rate-Splitting Multiple Access (RSMA) has emerged as a potent and reliable multiple access and interference management technique in wireless communications. While downlink Multiple-Input Multiple-Ouput (MIMO) RSMA has been widely…

Information Theory · Computer Science 2024-06-04 Jiawei Xu , Bruno Clerckx

In next generation Internet-of-Things, the overhead introduced by grant-based multiple access protocols may engulf the access network as a consequence of the unprecedented number of connected devices. Grant-free access protocols are…

Signal Processing · Electrical Eng. & Systems 2023-05-16 Lorenzo Valentini , Marco Chiani , Enrico Paolini

Rate-Splitting Multiple Access (RSMA) for multi-user downlink operates by splitting the message for each user equipment (UE) into a private message and a set of common messages, which are simultaneously transmitted by means of superposition…

Signal Processing · Electrical Eng. & Systems 2022-03-09 Daesung Yu , Seok-Hwan Park , Osvaldo Simeone , Shlomo Shamai

Intelligent terminals often produce a large number of data packets of small lengths. For these packets, it is inefficient to follow the conventional medium access control (MAC) protocols because they lead to poor utilization of service…

Information Theory · Computer Science 2016-11-18 Ronggui Xie , Huarui Yin , Zhengdao Wang , Xiaohui Chen

Massive machine type communication (mMTC) has been identified as an important use case in Beyond 5G networks and future massive Internet of Things (IoT). However, for the massive multiple access in mMTC, there is a serious access preamble…

Information Theory · Computer Science 2021-02-26 Gaofeng Cheng , Huan Chen , Pingzhi Fan , Li Li , Li Hao

The problem of wireless M2M communication is twofold: the reliability aspect and the scalability aspect. The solution of this problem demands a delay constrained random access protocol. To this end we propose Admission Control based Traffic…

Networking and Internet Architecture · Computer Science 2019-03-28 H. Murat Gürsu , Mikhail Vilgelm , Alberto M. Alba , Matteo Berioli , Wolfgang Kellerer

The thesis is dedicated to studying methods to improve the efficiency of random access schemes and to facilitate their deployment in machine-type communications (MTC). First, a joint user activity identification and channel estimation…

Information Theory · Computer Science 2019-06-11 Zhuo Sun

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

The performance of grant-free random access (GF-RA) is limited by the number of accessible random access resources (RRs) due to the absence of collision resolution. Compressive sensing (CS)-based RA schemes scale up the RRs at the expense…

Information Theory · Computer Science 2021-03-23 Ameha Tsegaye Abebe , Chung G. Kang