### On Properties of the Support of Capacity-Achieving Distributions for Additive Noise Channel Models with Input Cost Constraints

**2016-02-02**

1602.00878 | cs.IT

We study the classical problem of characterizing the channel capacity and its
achieving distribution in a generic fashion. We derive a simple relation
between three parameters: the input-output function, the input cost function
and the noise probability density function, one which dictates the type of the
optimal input. In Layman terms we prove that the support of the optimal input
is bounded whenever the cost grows faster than a cut-off rate equal to the
logarithm of the noise PDF evaluated at the input-output function. Furthermore,
we prove a converse statement that says whenever the cost grows slower than the
cut-off rate, the optimal input has necessarily an unbounded support. In
addition, we show how the discreteness of the optimal input is guaranteed
whenever the triplet satisfy some analyticity properties. We argue that a
suitable cost function to be imposed on the channel input is one that grows
similarly to the cut-off rate. Our results are valid for any cost function that
is super-logarithmic. They summarize a large number of previous channel
capacity results and give new ones for a wide range of communication channel
models, such as Gaussian mixtures, generalized-Gaussians and heavy-tailed noise
models, that we state along with numerical computations.

**Login to like/save this paper, take notes and configure your recommendations**

# Related Articles

**2017-10-20**

1710.07453 | stat.ML

Introducing inequality constraints in Gaussian process (GP) models can lead
to more realistic uncert… show more

**2019-03-21**

1903.09299 | cs.IT

In this paper, we study information-theoretic limits for simultaneous
wireless information and power… show more

**2016-01-22**

1601.06101 | cs.IT

Most communication channels are subjected to noise. One of the goals of
Information Theory is to add… show more

**2018-07-09**

1807.03422 | cs.IT

In this paper, we make use of channel symmetry properties to determine the
capacity region of three … show more

**2017-10-26**

1710.09754 | cs.IT

We consider a covert communication scenario where a transmitter wishes to
communicate simultaneously… show more

**2019-01-10**

1901.03264 | cs.IT

This paper studies an $n$-dimensional additive Gaussian noise channel with a
peak-power-constrained … show more

**2018-08-17**

1808.05922 | cs.IT

This paper addresses point-to-point communication over block-fading channels
with independent fading… show more

**2018-06-29**

1806.11531 | cs.IT

The sphere packing bound is proved for codes on the discrete stationary
product channels with feedba… show more

**2018-04-17**

1804.06372 | cs.IT

Sphere packing bounds (SPBs) ---with prefactors that are polynomial in the
block length--- are deriv… show more

**2018-03-21**

1803.07937 | cs.IT

For any channel, the existence of a unique Augustin mean is established for
any positive order and p… show more

**2018-01-09**

1801.02745 | cs.IT

New capacity upper bounds are presented for the discrete-time Poisson channel
with no dark current a… show more

**2017-04-17**

1704.04904 | cs.IT

The per-sample zero-dispersion channel model of the optical fiber is
considered. It is shown that ca… show more

**2018-04-23**

1804.08524 | cs.IT

This paper studies the capacity of an $n$-dimensional vector Gaussian noise
channel subject to the c… show more

**2018-10-17**

1810.07687 | cs.IT

The covert capacity is characterized for a non-coherent fast Rayleigh-fading
wireless channel, in wh… show more

**2018-10-01**

1810.00513 | cs.IT

In our previous paper [Phys. Rev. E 95, 062122 (2017)] we considered the
optical channel modelled by… show more

**2019-07-18**

1907.08063 | cs.IT

The capacity of unifilar finite-state channels in the presence of feedback is
investigated. We deriv… show more

**2017-04-23**

1704.06962 | cs.IT

In this paper we consider a channel model that is often used to describe the
mobile wireless scenari… show more