English
Related papers

Related papers: Energy Efficiency of Unsourced Random Access over …

200 papers

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

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

We use the idea of dependence balance to obtain a new outer bound for the capacity region of the discrete memoryless multiple access channel with noiseless feedback (MAC-FB). We consider a binary additive noisy MAC-FB whose feedback…

Information Theory · Computer Science 2016-11-17 Ravi Tandon , Sennur Ulukus

A concatenated coding scheme over binary memoryless symmetric (BMS) channels using a polarization transformation followed by outer sub-codes is analyzed. Achievable error exponents and upper bounds on the error rate are derived. The first…

Information Theory · Computer Science 2017-10-24 Dina Goldin , David Burshtein

This article shows that the capacity region of a two users weak Gaussian interference channel can be achieved using single letter Gaussian code-books. The approach relies on traversing the boundary in incremental steps. Starting from a…

Information Theory · Computer Science 2026-05-18 Amir K. Khandani

This article considers the massive MIMO unsourced random access problem on a quasi-static Rayleigh fading channel. Given a fixed message length and a prescribed number of channel uses, the objective is to construct a coding scheme that…

Information Theory · Computer Science 2022-03-09 Michail Gkagkos , Krishna R. Narayanan , Jean-Francois Chamberland , Costas N. Georghiades

We establish several upper bounds on the energy-constrained quantum and private capacities of all single-mode phase-insensitive bosonic Gaussian channels. The first upper bound, which we call the "data-processing bound," is the simplest and…

Quantum Physics · Physics 2018-06-18 Kunal Sharma , Mark M. Wilde , Sushovit Adhikari , Masahiro Takeoka

In this letter, we consider a Linear Quadratic Gaussian (LQG) control system where feedback occurs over a noiseless binary channel and derive lower bounds on the minimum communication cost (quantified via the channel bitrate) required to…

Information Theory · Computer Science 2022-06-06 Travis C. Cuvelier , Takashi Tanaka , Robert W. Heath

We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of…

Information Theory · Computer Science 2010-11-22 Chao Tian , Suhas Diggavi , Shlomo Shamai

This paper considers an unlicensed multiple-access channel (MAC) that coexists with a licensed point-to-point user, following the underlay cognitive radio paradigm. We assume that every transceiver except the secondary base station has one…

Information Theory · Computer Science 2018-11-09 Christian Lameiro , Ignacio Santamaria , Peter J. Schreier

This paper revisits the Gaussian degraded relay channel, where the link that carries information from the source to the destination is a physically degraded version of the link that carries information from the source to the relay. The…

Information Theory · Computer Science 2016-10-19 Silas L. Fong , Vincent Y. F. Tan

For a stationary additive Gaussian-noise channel with a rational noise power spectrum of a finite-order $L$, we derive two new results for the feedback capacity under an average channel input power constraint. First, we show that a very…

Information Theory · Computer Science 2007-07-13 Shaohua Yang , Aleksandar Kavcic , Sekhar Tatikonda

Through refined asymptotic analysis based on the normal approximation, we study how higher-order coding performance depends on the mean power as well as on finer statistics of the input power. We introduce a multifaceted power model in…

Information Theory · Computer Science 2026-05-13 Adeel Mahmood , Aaron B. Wagner

This paper investigates the massive random access for a huge amount of user devices served by a base station (BS) equipped with a massive number of antennas. We consider a grant-free unsourced random access (U-RA) scheme where all users…

Information Theory · Computer Science 2020-09-15 Xinyu Xie , Yongpeng Wu , Junyuan Gao , Wenjun Zhang

Optimal modulation (OM) schemes for Gaussian channels with peak and average power constraints are known to require nonuniform probability distributions over signal points, which presents practical challenges. An established way to map…

Information Theory · Computer Science 2022-11-01 Basak Ozaydin , Muriel Médard , Ken Duffy

Optimal coding over the additive white Gaussian noise channel under the peak energy constraint is studied when there is noisy feedback over an orthogonal additive white Gaussian noise channel. As shown by Pinsker, under the peak energy…

Information Theory · Computer Science 2011-08-19 Yu Xiang , Young-Han Kim

We study communication systems over band-limited Additive White Gaussian Noise (AWGN) channels in which the transmitter output is constrained to be symmetric binary (bi-polar). In this work we improve the original Ozarov-Wyner-Ziv (OWZ)…

Information Theory · Computer Science 2021-10-07 Michael Peleg , Tomer Michaeli , Shlomo Shamai

This paper is a tutorial introduction to the field of unsourced multiple access (UMAC) protocols. We first provide a historical survey of the evolution of random access protocols, focusing specifically on the case in which uncoordinated…

Information Theory · Computer Science 2024-08-20 Gianluigi Liva , Yury Polyanskiy

A cache-aided $K$-user Gaussian broadcast channel (BC) is considered. The transmitter has a library of $N$ equal-rate files, from which each user demands one. The impact of the equal-capacity receiver cache memories on the minimum required…

Information Theory · Computer Science 2018-05-01 Mohammad Mohammadi Amiri , Deniz Gunduz

We investigate whether uncoded schemes are optimal for Gaussian sources on multiuser Gaussian channels. Particularly, we consider two problems: the first is to send correlated Gaussian sources on a Gaussian broadcast channel where each…

Information Theory · Computer Science 2017-03-02 Chao Tian , Jun Chen , Suhas Diggavi , Shlomo Shamai