English
Related papers

Related papers: On Stochastic Orders and Fast Fading Multiuser Cha…

200 papers

An analytically tractable model for Gaussian multiuser channels with fading is studied, and the capacity region of this model is found to be a good approximation of the capacity region of the original Gaussian network. This work extends the…

Information Theory · Computer Science 2009-05-16 Rony EL Haddad , Brian Smith , Sriram Vishwanath

The mutual information of a discrete time memoryless Rayleigh fading channel is considered, where neither the transmitter nor the receiver has the knowledge of the channel state information except the fading statistics. We present the…

Information Theory · Computer Science 2007-07-13 Rasika Perera , Tony Pollock , Thushara Abhayapala

There are currently a plurality of capacity theories of fading channels, including the ergodic capacity for fast fading channels and outage capacity for slow fading channels. However, analyses show that the outage capacity is a…

Information Theory · Computer Science 2019-04-01 Xuezhi Yang

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as many-user information…

Information Theory · Computer Science 2014-05-06 Xu Chen , Dongning Guo

We study the throughput capacity region of the Gaussian multi-access (MAC) fading channel with perfect channel state information (CSI) at the receiver and at the transmitters, at low power regime. We show that it has a multidimensional…

Information Theory · Computer Science 2013-11-01 Zouheir Rezki , Mohamed-Slim Alouini

A new stochastic order between two fading distributions is introduced. A fading channel dominates another in the ergodic capacity ordering sense, if the Shannon transform of the first is greater than that of the second at all values of…

Information Theory · Computer Science 2016-11-15 Adithya Rajan , Cihan Tepedelenlioglu

This paper considers an arbitrarily-varying fading channel consisting of one transmitter, one receiver and an arbitrarily varying adversary. The channel is assumed to have additive Gaussian noise and fast fading of the gain from the…

Information Theory · Computer Science 2021-06-15 Fatemeh Hosseinigoki , Oliver Kosut

This paper studies a memoryless state-dependent multiple access channel (MAC) where two transmitters wish to convey a message to a receiver under the assumption of causal and imperfect channel state information at transmitters (CSIT) and…

Information Theory · Computer Science 2021-06-18 Lorenzo Miretti , Mari Kobayashi , David Gesbert , Paul de Kerret

The task of jointly communicating a message and reconstructing a common estimate of the channel state is examined for a fading Gaussian model with additive state interference. The state is an independent and identically distributed Gaussian…

Information Theory · Computer Science 2026-01-07 Viswanathan Ramachandran

Generalized mutual information (GMI) is used to compute achievable rates for fading channels with various types of channel state information at the transmitter (CSIT) and receiver (CSIR). The GMI is based on variations of auxiliary channel…

Information Theory · Computer Science 2023-05-23 Gerhard Kramer

A fading broadcast channel is considered where the transmitter employs two antennas and each of the two receivers employs a single receive antenna. It is demonstrated that even if the realization of the fading is precisely known to the…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Shlomo Shamai , Michele Wigger

In this work, we consider the problem of distributed approximation of functions over multiple-access channels with additive noise. In contrast to previous works, we take fast fading into account and give explicit probability bounds for the…

Information Theory · Computer Science 2021-03-01 Igor Bjelakovic , Matthias Frey , Slawomir Stanczak

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. This work proposes a new paradigm, referred to as {\em many-user…

Information Theory · Computer Science 2017-02-13 Xu Chen , Tsung-Yi Chen , Dongning Guo

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

This paper presents a statistical block fading channel model for multiuser massive MIMO system. The proposed channel model is evolved from correlation based stochastic channel model (CBSCM) but in addition to the properties of CBSCM, it has…

Information Theory · Computer Science 2016-04-05 Suresh Dahiya

We investigate the problem of message transmission over time-varying single-user multiple-input multiple-output (MIMO) Rayleigh fading channels with average power constraint and with complete channel state information available at the…

Information Theory · Computer Science 2022-04-14 Rami Ezzine , Moritz Wiese , Christian Deppe , Holger Boche

Classical multiuser information theory studies the fundamental limits of models with a fixed (often small) number of users as the coding blocklength goes to infinity. Motivated by emerging systems with a massive number of users, this paper…

Information Theory · Computer Science 2014-05-06 Tsung-Yi Chen , Xu Chen , Dongning Guo

As shown by M\'edard, the capacity of fading channels with imperfect channel-state information (CSI) can be lower-bounded by assuming a Gaussian channel input $X$ with power $P$ and by upper-bounding the conditional entropy $h(X|Y,\hat{H})$…

Information Theory · Computer Science 2016-11-15 Adriano Pastore , Tobias Koch , Javier Rodríguez Fonollosa

In wiretap channels the eavesdropper's channel state information (CSI) is commonly assumed to be known at transmitter, fully or partially. However, under perfect secrecy constraint the eavesdropper may not be motivated to feedback any…

Information Theory · Computer Science 2013-07-10 Pin-Hsun Lin , Chien-Li Su , Hsuan-Jung Su

This paper investigates the capacity problem for some multiple-access scenarios with cooperative transmitters. First, a general Multiple-Access Channel (MAC) with common information, i.e., a scenario where p transmitters send private…

Information Theory · Computer Science 2013-02-17 Ali Haghi , Reza K. Farsani , Mohammad Reza Aref , Farokh Marvasti
‹ Prev 1 2 3 10 Next ›