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.

  

Efficient Approximation of Discrete Memoryless Channel Capacities

Author(s):

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

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

We propose an iterative method for efficiently approximating the capacity of discrete memoryless channels, possibly having additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. To find an epsilon-approximation of the capacity, in case of no additional input constraints, the presented method has a computational complexity O(1/epsilon M^2 N (log N)^(1/2)), where N and M denote the input and output alphabet size, and a single iteration has a complexity O(M N).

Further Information
Year:

2014
Type of Publication:

(01)Article
Supervisor:



No Files for download available.
% Autogenerated BibTeX entry
@InProceedings { SutEtal:2014:IFA_4721,
    author={D. Sutter and P. Mohajerin Esfahani and T. Sutter and J. Lygeros},
    title={{Efficient Approximation of Discrete Memoryless Channel
	  Capacities}},
    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=4721}
}
Permanent link