English
Related papers

Related papers: Massive Unsourced Random Access for Massive MIMO C…

200 papers

Rate-Splitting Multiple Access (RSMA) is a robust multiple access scheme for downlink multi-antenna wireless networks. In this work, we investigate a novel application of RSMA for joint communications and jamming with a Multi-Carrier (MC)…

Information Theory · Computer Science 2021-08-13 Onur Dizdar , Bruno Clerckx

This paper presents a new approach to intra-cell pilot contamination in crowded massive MIMO scenarios. The approach relies on two essential properties of a massive MIMO system, namely near-orthogonality between user channels and…

Information Theory · Computer Science 2015-05-22 Jesper H. Sørensen , Elisabeth de Carvalho , Petar Popovski

Algorithms for Massive MIMO uplink detection typically rely on a centralized approach, by which baseband data from all antennas modules are routed to a central node in order to be processed. In case of Massive MIMO, where hundreds or…

Signal Processing · Electrical Eng. & Systems 2018-08-29 Jesus Rodriguez Sanchez , Fredrik Rusek , Muris Sarajlic , Ove Edfors , Liang Liu

In this paper, a downlink communication system, in which a Base Station (BS) equipped with $M$ antennas communicates with $N$ users each equipped with $K$ receive antennas, is considered. An efficient suboptimum algorithm is proposed for…

Information Theory · Computer Science 2007-07-13 Alireza Bayesteh , Amir Keyvan Khandani

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

Unsourced random access (URA) has emerged as a pragmatic framework for next-generation distributed sensor networks. Within URA, concatenated coding structures are often employed to ensure that the central base station can accurately recover…

Information Theory · Computer Science 2021-12-02 Vamsi K. Amalladinne , Jamison R. Ebert , Jean-Francois Chamberland , Krishna R. Narayanan

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

We consider multiple transmitters aiming to communicate their source signals (e.g., images) over a multiple access channel (MAC). Conventional communication systems minimize interference by orthogonally allocating resources (time and/or…

Networking and Internet Architecture · Computer Science 2025-04-08 Selim F. Yilmaz , Can Karamanli , Deniz Gunduz

This paper addresses the problem of estimating sparse channels in massive MIMO-OFDM systems. Most wireless channels are sparse in nature with large delay spread. In addition, these channels as observed by multiple antennas in a neighborhood…

Applications · Statistics 2015-06-22 Mudassir Masood , Laila H. Afify , Tareq Y. Al-Naffouri

In this paper, we propose a turbo receiver for joint activity detection and data decoding in grant-free massive random access, which iterates between a detector and a belief propagation (BP)-based channel decoder. Specifically, responsible…

Signal Processing · Electrical Eng. & Systems 2021-07-21 Xinyu Bian , Yuyi Mao , Jun Zhang

In this paper we provide an achievable rate region for the discrete memoryless multiple access channel with correlated state information known non-causally at the encoders using a random binning technique. This result is a generalization of…

Information Theory · Computer Science 2008-12-31 Tal Philosof , Ram Zamir , Uri Erez

In this paper, we propose low complexity algorithms based on Markov chain Monte Carlo (MCMC) technique for signal detection and channel estimation on the uplink in large scale multiuser multiple input multiple output (MIMO) systems with…

Information Theory · Computer Science 2012-01-31 Tanumay Datta , N. Ashok Kumar , A. Chockalingam , B. Sundar Rajan

We study the problem of medium access control in domain of event-driven wireless sensor networks (WSNs). In this kind of WSN, sensor nodes send data to sink node only when an event occurs in the monitoring area. The nodes in this kind of…

Networking and Internet Architecture · Computer Science 2012-05-22 Rajeev K. Shakya , Yatindra Nath Singh , Nishchal K. Verma

This two-part paper aims to quantify the cost of device activity detection in an uplink massive connectivity scenario with a large number of devices but device activities are sporadic. Part I of this paper shows that in an asymptotic…

Information Theory · Computer Science 2018-05-09 Liang Liu , Wei Yu

This work explores the channel estimation (CE) problem in uplink transmission for unsourced random access (URA) with a fluid antenna receiver. The additional spatial diversity in a fluid antenna system (FAS) addresses the needs of URA…

Information Theory · Computer Science 2025-04-25 Keru Zhou , Zhentian Zhang , Jian Dang , Qianqian Sun , Zaichen Zhang

Massive multiple-input multiple-output (MIMO) is a fundamental enabler to provide high data throughput in next generation cellular networks. By equipping the base stations (BSs) with tens or hundreds of antenna elements, narrow and high…

Networking and Internet Architecture · Computer Science 2018-01-26 Paolo Baracca , Andreas Weber , Thorsten Wild , Christophe Grangeat

Smart wireless environments enabled by multiple distributed Reconfigurable Intelligent Surfaces (RISs) have recently attracted significant research interest as a wireless connectivity paradigm for sixth Generation (6G) networks. In this…

Information Theory · Computer Science 2024-10-11 Aris L. Moustakas , George C. Alexandropoulos

The central challenge in massive machine-type communications (mMTC) is to connect a large number of uncoordinated devices through a limited spectrum. The typical mMTC communication pattern is sporadic, with short packets. This could be…

Information Theory · Computer Science 2022-09-29 Yanna Bai , Wei Chen , Feifei Sun , Bo Ai , Petar Popovski

We derive an achievability bound to quantify the performance of a type-based unsourced multiple access system -- an information-theoretic model for grant-free multiple access with correlated messages. The bound extends available…

Information Theory · Computer Science 2025-04-29 Deekshith Pathayappilly Krishnan , Kaan Okumus , Khac-Hoang Ngo , Giuseppe Durisi

This article investigates the robustness of rate-splitting multiple access (RSMA) in multi-user multiple-input single-output (MISO) systems to interference attacks against channel acquisition induced by beyond-diagonal RISs (BD-RISs). Two…

Signal Processing · Electrical Eng. & Systems 2026-02-19 Arthur S. de Sena , Jacek Kibilda , Nurul H. Mahmood , Andre Gomes , Luiz A. DaSilva , Matti Latva-aho