none3noThis paper establishes sufficient conditions under which a memoryless channel with real, scalar and peak power limited input exhibits a capacity achieving input probability measure that is discrete with a finite number of probability mass points. A proof for the sufficiency of the proposed conditions is presented. Some examples are also illustrated as further evidence for the presented theory.noneVincenzo Zambianchi;Enrico Paolini;Davide DardariVincenzo Zambianchi;Enrico Paolini;Davide Dardar
The main concerns of this thesis are some special families of channels with memory, which are of gre...
Proceeding of: IEEE International Symposium on Information Theory (ISIT 2018)The capacity-achieving...
tionary Gaussian fading channel is studied, where neither the transmitter nor the receiver knows the...
The problem of capacity achieving (optimal) input probability measure (p.m.) has been widely investi...
In this paper, we investigate the capacity and capacity-achieving input probability distributions (I...
We address the problem of finding the capacity of fading channels under the assumption of amplitude-...
Conference paperWe derive the ergodic capacity of discrete-time fading channel with additive Gaussi...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
International audienceIn this paper, a new framework based on the notion of \textit{capacity sensiti...
An additive noise channel wherein the noise is described by a piecewise constant probability density...
We study the channel capacity of a general discrete energy harvesting channel with a finite battery....
Ahlswede R. A note on the existence of the weak capacity for channels with arbitrarily varying chann...
Abstract—We determine the capacity of a discrete memoryless communication channel with an energy har...
The capacity of a deterministic multiple-input multiple-output channel under the peak and average po...
Abstract—Despite being an accepted model for a wide variety of optical channels, few general results...
The main concerns of this thesis are some special families of channels with memory, which are of gre...
Proceeding of: IEEE International Symposium on Information Theory (ISIT 2018)The capacity-achieving...
tionary Gaussian fading channel is studied, where neither the transmitter nor the receiver knows the...
The problem of capacity achieving (optimal) input probability measure (p.m.) has been widely investi...
In this paper, we investigate the capacity and capacity-achieving input probability distributions (I...
We address the problem of finding the capacity of fading channels under the assumption of amplitude-...
Conference paperWe derive the ergodic capacity of discrete-time fading channel with additive Gaussi...
Abstract-A formula for the capacity of arbitrary single-user channels without feedback (not necessar...
International audienceIn this paper, a new framework based on the notion of \textit{capacity sensiti...
An additive noise channel wherein the noise is described by a piecewise constant probability density...
We study the channel capacity of a general discrete energy harvesting channel with a finite battery....
Ahlswede R. A note on the existence of the weak capacity for channels with arbitrarily varying chann...
Abstract—We determine the capacity of a discrete memoryless communication channel with an energy har...
The capacity of a deterministic multiple-input multiple-output channel under the peak and average po...
Abstract—Despite being an accepted model for a wide variety of optical channels, few general results...
The main concerns of this thesis are some special families of channels with memory, which are of gre...
Proceeding of: IEEE International Symposium on Information Theory (ISIT 2018)The capacity-achieving...
tionary Gaussian fading channel is studied, where neither the transmitter nor the receiver knows the...