English
Related papers

Related papers: Approximate Capacity of Fast Fading Interference C…

200 papers

This paper considers the massive random access problem in MIMO quasi-static Rayleigh fading channels. Specifically, we derive achievability and converse bounds on the minimum energy-per-bit required for each active user to transmit $J$ bits…

Information Theory · Computer Science 2022-10-24 Junyuan Gao , Yongpeng Wu , Shuo Shao , Wei Yang , H. Vincent Poor

In this paper, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios in which…

Information Theory · Computer Science 2016-11-18 Victor Quintero , Samir M. Perlaza , Jean-Marie Gorce

In this technical report, the capacity region of the two-user linear deterministic (LD) interference channel with noisy output feedback (IC-NOF) is fully characterized. This result allows the identification of several asymmetric scenarios…

Information Theory · Computer Science 2016-11-16 Victor Quintero , Samir M. Perlaza , Jean-Marie Gorce

In this paper, taking into account the effect of link delays, we investigate the capacity region of the Cognitive Interference Channel (C-IFC), where cognition can be obtained from either causal or non-causal generalized feedback. For this…

Information Theory · Computer Science 2012-02-02 Mahtab Mirmohseni , Bahareh Akhbari , Mohammad Reza Aref

In this paper, an achievability region and a converse region for the two-user Gaussian interference channel with noisy channel-output feedback (G-IC-NOF) are presented. The achievability region is obtained using a random coding argument and…

Information Theory · Computer Science 2016-11-18 Victor Quintero , Samir M. Perlaza , Iñaki Esnaola , Jean-Marie Gorce

We investigate the constrained capacity of multiple-antenna fading coherent channels, where the receiver knows the channel state but the transmitter knows only the channel distribution, driven by arbitrary equiprobable discrete inputs in a…

Information Theory · Computer Science 2012-10-26 Miguel Rodrigues

We derive a lower bound on the capacity pre-log of a temporally correlated Rayleigh block-fading multiple-input multiple-output (MIMO) channel with T transmit antennas and R receive antennas in the noncoherent setting (no a priori channel…

Information Theory · Computer Science 2013-02-12 Günther Koliander , Erwin Riegler , Giuseppe Durisi , Veniamin I. Morgenshtern , Franz Hlawatsch

Traditionally, the capacity region of a coherent fading multiple access channel (MAC) is analyzed in two popular contexts. In the first, a centralized system with full channel state information at the transmitters (CSIT) is assumed, and the…

Information Theory · Computer Science 2014-09-17 Sreejith Sreekumar , Bikash K. Dey , Sibi Raj B. Pillai

In recent years the concept of the effective capacity that relates the physical layer characteristics of a wireless channel to the data link layer has gained a lot of attraction in wireless networking research community. The effective…

Networking and Internet Architecture · Computer Science 2012-07-13 Mehdi Vasef

In this part, we consider the capacity analysis for wireless mobile systems with multiple antenna architectures. We apply the results of the first part to a commonly known baseband, discrete-time multiple antenna system where both the…

Information Theory · Computer Science 2007-07-13 Majid Fozunbal , Steven W. McLaughlin , Ronald W. Schafer

This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent…

Information Theory · Computer Science 2008-05-01 Tobias Koch , Amos Lapidoth

Communication over the i.i.d. Rayleigh slow-fading MAC is considered, where all terminals are equipped with a single antenna. Further, a communication protocol is considered where all users transmit at (just below) the symmetric capacity…

Information Theory · Computer Science 2024-10-30 Elad Domanovitz , Uri Erez

We investigate how to exploit intermittent feedback for interference management by studying the two-user Gaussian interference channel (IC). We approximately characterize (within a universal constant) the capacity region for the Gaussian IC…

Information Theory · Computer Science 2016-11-17 Can Karakus , I-Hsiang Wang , Suhas Diggavi

We investigate the maximal achievable rate for a given blocklength and error probability over quasi-static single-input multiple-output (SIMO) fading channels. Under mild conditions on the channel gains, it is shown that the channel…

Information Theory · Computer Science 2013-05-17 Wei Yang , Giuseppe Durisi , Tobias Koch , Yury Polyanskiy

This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…

Information Theory · Computer Science 2025-09-26 Grace Villacrés , Tobias Koch , Gonzalo Vazquez-Vilar

In this work, we obtain lower and upper bounds on the maximal transmission rate at a given codeword length $n$, average probability of error $\epsilon$ and power constraint $\bar{P}$, over a finite valued, block fading additive white…

Information Theory · Computer Science 2017-11-15 Deekshith P K , Vinod Sharma

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

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

This paper presents a comprehensive analysis of the information-energy capacity region for simultaneous lightwave information and power transfer (SLIPT) systems over lognormal fading channels. Unlike conventional studies that primarily…

Information Theory · Computer Science 2026-04-27 Nizar Khalfet , Kapila W. S. Palitharathna , Symeon Chatzinotas , Ioannis Krikidis

The capacity region of the Finite-State Multiple Access Channel (FS-MAC) with feedback that may be an arbitrary time-invariant function of the channel output samples is considered. We provided a sequence of inner and outer bounds for this…

Information Theory · Computer Science 2008-02-12 Haim H. Permuter , Tsachy Weissman , Jun Chen