English
Related papers

Related papers: Capacity of Fading Channels without Channel Side I…

200 papers

In this paper, fading Gaussian multiuser channels are considered. If the channel is perfectly known to the transmitter, capacity has been established for many cases in which the channels may satisfy certain information theoretic orders such…

Information Theory · Computer Science 2018-10-04 Pin-Hsun Lin , Eduard A. Jorswieck , Rafael F. Schaefer , Martin Mittelbach , Carsten R. Janda

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

This work studies the capacity region of a two-user ergodic interference channel with fading, where only one of the users is subject to interference from the other user, and the channel state information (CSI) is only available at the…

Information Theory · Computer Science 2009-11-06 Yan Zhu , Dongning Guo

We consider a peak-power-limited single-antenna block-stationary Gaussian fading channel where neither the transmitter nor the receiver knows the channel state information, but both know the channel statistics. This model subsumes most…

Information Theory · Computer Science 2016-11-17 Jun Chen , Venugopal V. Veeravalli

Transmission of information over a discrete-time memoryless Rician fading channel is considered where neither the receiver nor the transmitter knows the fading coefficients. First the structure of the capacity-achieving input signals is…

Information Theory · Computer Science 2016-11-17 Mustafa Cenk Gursoy , H. Vincent Poor , Sergio Verdu

MIMO processing techniques in fiber optical communications have been proposed as a promising approach to meet increasing demand for information throughput. In this context, the multiple channels correspond to the multiple modes and/or…

Information Theory · Computer Science 2013-12-03 Apostolos Karadimitrakis , Aris L. Moustakas , Pierpaolo Vivo

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

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

The capacity of non-coherent stationary Gaussian fading channels with memory under a peak-power constraint is studied in the asymptotic weak-signal regime. It is assumed that the fading law is known to both transmitter and receiver but that…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Ligong Wang

In this paper we deal with a single-antenna discrete-time flat-fading channel. The fading process is assumed to be stationary for the duration of a single data block. From block to block the fading process is allowed to be non-stationary.…

Information Theory · Computer Science 2007-07-13 Thomas Zemen , Stefan M. Moser

We investigate energy efficient packet scheduling and power allocation problem for the services which require reliable communication to guarantee a certain quality of experience (QoE). We establish links between average transmit power and…

Information Theory · Computer Science 2018-07-27 M. Majid Butt , Eduard A. Jorswieck , Nicola Marchetti

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 investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading…

Information Theory · Computer Science 2007-11-29 Wenyi Zhang , Urbashi Mitra

The capacity of time-varying channels with periodic feedback at the transmitter is evaluated. It is assumed that the channel state information is perfectly known at the receiver and is fed back to the transmitter at the regular…

Information Theory · Computer Science 2007-07-13 Mehdi Ansari Sadrabadi , Mohammad Ali Maddah-Ali , Amir K. Khandani

We consider a finite-state memoryless channel with i.i.d. channel state and the input Markov process supported on a mixing finite-type constraint. We discuss the asymptotic behavior of entropy rate of the output hidden Markov chain and…

Information Theory · Computer Science 2010-07-28 Guangyue Han , Brian Marcus

This paper investigates point-to-point information transmission over a wideband slow-fading channel, modeled as an (asymptotically) large number of independent identically distributed parallel channels, with the random channel fading…

Information Theory · Computer Science 2007-10-02 Wenyi Zhang , Urbashi Mitra

We derive an approximate expression for mutual information in a broad class of discrete-time stationary channels with continuous input, under the constraint of vanishing input amplitude or power. The approximation describes the input by its…

Information Theory · Computer Science 2015-05-19 Lubomir Kostal

A discrete-time single-user scalar channel with temporally correlated Rayleigh fading is analyzed. There is no side information at the transmitter or the receiver. A simple expression is given for the capacity per unit energy, in the…

Information Theory · Computer Science 2007-07-16 Vignesh Sethuraman , Bruce Hajek

In this paper, we investigate upper and lower bounds on the capacity of two-user fading broadcast channels where one of the users has a constant (non-fading) channel. We use the Costa entropy power inequality (EPI) along with an…

Information Theory · Computer Science 2009-01-01 Amin Jafarian , Sriram Vishwanath

The goal of this paper is to obtain a better knowledge of the achievable data rate over noncoherent Rician fading channel with time and frequency memory. We assume that the average-power as well as the peak-power of the input signal are…

Information Theory · Computer Science 2012-07-13 Jean-Michel Passerieux , Francois-Xavier Socheleau , Christophe Laot
‹ Prev 1 2 3 10 Next ›