English
Related papers

Related papers: Pilot-Based Unsourced Random Access with a Massive…

200 papers

Unlike the AWGN (additive white gaussian noise) channel, fading channels suffer from random channel gains besides the additive Gaussian noise. As a result, the instantaneous channel capacity varies randomly along time, which makes it…

Information Theory · Computer Science 2014-07-18 Yunquan Dong , Pingyi Fan

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

We propose a numerically efficient method for evaluating the random-coding union bound with parameter $s$ on the error probability achievable in the finite-blocklength regime by a pilot-assisted transmission scheme employing Gaussian…

Information Theory · Computer Science 2023-08-21 A. Oguz Kislal , Alejandro Lancho , Giuseppe Durisi , Erik Ström

We put forward a new algorithmic solution to the massive unsourced random access (URA) problem, by leveraging the rich spatial dimensionality offered by large-scale antenna arrays. This paper makes an observation that spatial signature is…

Information Theory · Computer Science 2020-09-16 Volodymyr Shyianov , Faouzi Bellili , Amine Mezghani , Ekram Hossain

This article presents a novel transmission scheme for the unsourced, uncoordinated Gaussian multiple access problem. The proposed scheme leverages notions from single-user coding, random spreading, minimum-mean squared error (MMSE)…

Information Theory · Computer Science 2019-11-05 Asit Kumar Pradhan , Vamsi K. Amalladinne , Krishna R. Narayanan , Jean-Francois Chamberland

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

This paper proposes a unified semi-blind detection framework for sourced and unsourced random access (RA), which enables next-generation ultra-reliable low-latency communications (URLLC) with massive devices. Specifically, the active…

Information Theory · Computer Science 2023-03-21 Malong Ke , Zhen Gao , Mingyu Zhou , Dezhi Zheng , Derrick Wing Kwan Ng , H. Vincent Poor

This paper presents finite-blocklength achievability bounds for the Gaussian multiple access channel (MAC) and random access channel (RAC) under average-error and maximal-power constraints. Using random codewords uniformly distributed on a…

Information Theory · Computer Science 2022-05-05 Recep Can Yavas , Victoria Kostina , Michelle Effros

We study a lossy source coding problem for a memoryless remote source. The source data is broadcast over an arbitrarily varying channel (AVC) controlled by an adversary. One output of the AVC is received as input at the encoder, and another…

Information Theory · Computer Science 2017-04-26 Amitalok J. Budkuley , Bikash Kumar Dey , Vinod M. Prabhakaran

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

Enabling autonomous driving and industrial automation with wireless networks poses many challenges, which are typically abstracted through reliability and latency requirements. One of the main contributors to latency in cellular networks is…

Networking and Internet Architecture · Computer Science 2019-02-22 H. Murat Gürsu , Wolfgang Kellerer , Cedomir Stefanović

This article introduces a novel paradigm for the unsourced multiple-access communication problem. This divide-and-conquer approach leverages recent advances in compressive sensing and forward error correction to produce a computationally…

Information Theory · Computer Science 2018-06-04 Vamsi K. Amalladinne , Avinash Vem , Dileep Kumar Soma , Krishna R. Narayanan , Jean-Francois Chamberland

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

Due to the limited number of traditional orthogonal pilots, pilot collision will severely degrade the performance of contention-based grant-free transmission. To alleviate the pilot collision and exploit the spatial degree of freedom as…

Information Theory · Computer Science 2021-06-09 Zhifeng Yuan , Zhigang Li , Weimin Li , Yihua Ma

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

The number of wireless devices is drastically increasing, resulting in many devices contending for radio resources. In this work, we present an algorithm to detect active devices for unsourced random access, i.e., the devices are…

Information Theory · Computer Science 2023-01-13 Gilles Callebaut , François Rottenberg , Liesbet Van der Perre , Erik G. Larsson

Leveraging recent results in finite-blocklength information theory, we investigate the problem of designing a control channel in a 5G system. The setup involves the transmission, under stringent latency and reliability constraints, of a…

Information Theory · Computer Science 2018-02-02 Guido Carlo Ferrante , Johan Östman , Giuseppe Durisi , Kittipong Kittichokechai

Polyanskiy proposed a framework for the unsourced multiple access channel (MAC) problem where users employ a common codebook in the finite blocklength regime. However, existing approaches handle channel noise before the joint decoder. In…

Information Theory · Computer Science 2026-04-14 Yuming Han , Yuxin Long

We consider the problem of controlling an unstable plant over an additive white Gaussian noise (AWGN) channel with a transmit power constraint, where the signaling rate of communication is larger than the sampling rate (for generating…

Systems and Control · Computer Science 2016-10-31 Anatoly Khina , Gustav M. Pettersson , Victoria Kostina , Babak Hassibi

This work discusses the source broadcasting problem, i.e. transmitting a source to many receivers via a broadcast channel. The optimal rate-distortion region for this problem is unknown. The separation approach divides the problem into two…

Information Theory · Computer Science 2014-01-21 Uri Mendlovic , Meir Feder
‹ Prev 1 3 4 5 6 7 10 Next ›