Capacity approximation of memoryless channels with countable output alphabets

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

Capacity approximation of memoryless channels with countable output alphabets

Dateien

Zu diesem Dokument gibt es keine Dateien.

Datum

2014

Autor:innen

Sutter, Tobias

Mohajerin Esfahani, Peyman

Sutter, David

Lygeros, John

DOI (zitierfähiger Link)

https://doi.org/10.1109/ISIT.2014.6875366

Sammlungen

Informatik und Informationswissenschaft

Publikationstyp

Beitrag zu einem Konferenzband

Publikationsstatus

Published

Erschienen in

2014 IEEE International Symposium on Information Theory. Piscataway, NJ: IEEE, 2014, pp. 2909-2913. ISSN 2157-8095. eISSN 2157-8117. ISBN 978-1-4799-5186-4. Available under: doi: 10.1109/ISIT.2014.6875366

Zusammenfassung

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.

Fachgebiet (DDC)

004 Informatik

Konferenz

2014 IEEE International Symposium on Information Theory, 29. Juni 2014 - 4. Juli 2014, Honolulu, HI, USA

Zitieren

ISO 690

SUTTER, Tobias, Peyman MOHAJERIN ESFAHANI, David SUTTER, John LYGEROS, 2014. Capacity approximation of memoryless channels with countable output alphabets. 2014 IEEE International Symposium on Information Theory. Honolulu, HI, USA, 29. Juni 2014 - 4. Juli 2014. In: 2014 IEEE International Symposium on Information Theory. Piscataway, NJ: IEEE, 2014, pp. 2909-2913. ISSN 2157-8095. eISSN 2157-8117. ISBN 978-1-4799-5186-4. Available under: doi: 10.1109/ISIT.2014.6875366

BibTex

@inproceedings{Sutter2014Capac-55743,
  year={2014},
  doi={10.1109/ISIT.2014.6875366},
  title={Capacity approximation of memoryless channels with countable output alphabets},
  isbn={978-1-4799-5186-4},
  issn={2157-8095},
  publisher={IEEE},
  address={Piscataway, NJ},
  booktitle={2014 IEEE International Symposium on Information Theory},
  pages={2909--2913},
  author={Sutter, Tobias and Mohajerin Esfahani, Peyman and Sutter, David 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/55743">
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55743"/>
    <dc:creator>Lygeros, John</dc:creator>
    <dcterms:issued>2014</dcterms:issued>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T13:15:19Z</dcterms:available>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:language>eng</dc:language>
    <dc:creator>Mohajerin Esfahani, Peyman</dc:creator>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:abstract xml:lang="eng">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.</dcterms:abstract>
    <dc:creator>Sutter, David</dc:creator>
    <dc:contributor>Mohajerin Esfahani, Peyman</dc:contributor>
    <dc:contributor>Sutter, Tobias</dc:contributor>
    <dc:creator>Sutter, Tobias</dc:creator>
    <dc:contributor>Lygeros, John</dc:contributor>
    <dc:contributor>Sutter, David</dc:contributor>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:title>Capacity approximation of memoryless channels with countable output alphabets</dcterms:title>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T13:15:19Z</dc:date>
  </rdf:Description>
</rdf:RDF>

Universitätsbibliographie

Nein