Note: This content is accessible to all versions of every browser. However, this browser does not seem to support current Web standards, preventing the display of our site's design details.

  

Capacity Approximation of Memoryless Channels with Countable Output Alphabets

Author(s):

T. Sutter, P. Mohajerin Esfahani, D. Sutter, J. Lygeros
Conference/Journal:

IEEE International Symposium on Information Theory, Honolulu, Hawaii, USA
Abstract:

We present a new algorithm, based on duality of convex programming and the specific structure of the channel capacity problem, to iteratively construct upper and lower bounds for the capacity of memoryless channels having continuous input and countable output alphabets. Under a mild assumption on the decay rate of the channel's tail, explicit bounds for the approximation error are provided. We demonstrate the applicability of our result on the discrete-time Poisson channel having a peak-power input constraint.

Further Information
Year:

2014
Type of Publication:

(01)Article
Supervisor:



No Files for download available.
% Autogenerated BibTeX entry
@InProceedings { SutEtal:2014:IFA_4719,
    author={T. Sutter and P. Mohajerin Esfahani and D. Sutter and J. Lygeros},
    title={{Capacity Approximation of Memoryless Channels with
	  Countable Output Alphabets}},
    booktitle={IEEE International Symposium on Information Theory},
    pages={},
    year={2014},
    address={Honolulu, Hawaii, USA},
    month=jul,
    url={http://control.ee.ethz.ch/index.cgi?page=publications;action=details;id=4719}
}
Permanent link