Efficient approximation of discrete memoryless channel capacities

Sutter, David; Mohajerin Esfahani, Peyman; Sutter, Tobias; Lygeros, John

Efficient approximation of discrete memoryless channel capacities

Files

There are no files associated with this item.

Date

2014

Authors

Sutter, David

Mohajerin Esfahani, Peyman

Sutter, Tobias

Lygeros, John

Publication type

Contribution to a conference collection

Publication status

Published

Published in

2014 IEEE International Symposium on Information Theory. - Piscataway, NJ : IEEE, 2014. - pp. 2904-2908. - ISSN 2157-8095. - eISSN 2157-8117. - ISBN 978-1-4799-5186-4

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 ε-approximation of the capacity, in case of no additional input constraints, the presented method has a computational complexity O(1 over εM 2 N√(logN)), where N and M denote the input and output alphabet size, and a single iteration has a complexity O(MN).

Subject (DDC)

004 Computer Science

Conference

2014 IEEE International Symposium on Information Theory, Jun 29, 2014 - Jul 4, 2014, Honolulu, HI, USA

Cite This

ISO 690

SUTTER, David, Peyman MOHAJERIN ESFAHANI, Tobias SUTTER, John LYGEROS, 2014. Efficient approximation of discrete memoryless channel capacities. 2014 IEEE International Symposium on Information Theory. Honolulu, HI, USA, Jun 29, 2014 - Jul 4, 2014. In: 2014 IEEE International Symposium on Information Theory. Piscataway, NJ:IEEE, pp. 2904-2908. ISSN 2157-8095. eISSN 2157-8117. ISBN 978-1-4799-5186-4. Available under: doi: 10.1109/ISIT.2014.6875365

BibTex

@inproceedings{Sutter2014Effic-55742,
  year={2014},
  doi={10.1109/ISIT.2014.6875365},
  title={Efficient approximation of discrete memoryless channel capacities},
  isbn={978-1-4799-5186-4},
  issn={2157-8095},
  publisher={IEEE},
  address={Piscataway, NJ},
  booktitle={2014 IEEE International Symposium on Information Theory},
  pages={2904--2908},
  author={Sutter, David and Mohajerin Esfahani, Peyman and Sutter, Tobias and Lygeros, John}
}

RDF

<rdf:RDF
    xmlns:dcterms="http://purl.org/dc/terms/"
    xmlns:dc="http://purl.org/dc/elements/1.1/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:bibo="http://purl.org/ontology/bibo/"
    xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
    xmlns:foaf="http://xmlns.com/foaf/0.1/"
    xmlns:void="http://rdfs.org/ns/void#"
    xmlns:xsd="http://www.w3.org/2001/XMLSchema#" > 
  <rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/55742">
    <dc:creator>Sutter, David</dc:creator>
    <dc:creator>Sutter, Tobias</dc:creator>
    <dc:creator>Lygeros, John</dc:creator>
    <dcterms:abstract xml:lang="eng">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 ε-approximation of the capacity, in case of no additional input constraints, the presented method has a computational complexity O(1 over εM 2 N√(logN)), where N and M denote the input and output alphabet size, and a single iteration has a complexity O(MN).</dcterms:abstract>
    <dcterms:issued>2014</dcterms:issued>
    <dc:contributor>Mohajerin Esfahani, Peyman</dc:contributor>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55742"/>
    <dc:contributor>Sutter, Tobias</dc:contributor>
    <dc:contributor>Sutter, David</dc:contributor>
    <dc:language>eng</dc:language>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dcterms:title>Efficient approximation of discrete memoryless channel capacities</dcterms:title>
    <dc:contributor>Lygeros, John</dc:contributor>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T13:04:28Z</dc:date>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T13:04:28Z</dcterms:available>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Mohajerin Esfahani, Peyman</dc:creator>
  </rdf:Description>
</rdf:RDF>

Bibliography of Konstanz

No