KOPS - The Institutional Repository of the University of Konstanz

Capacity approximation of memoryless channels with countable output alphabets

Capacity approximation of memoryless channels with countable output alphabets

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

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, Jun 29, 2014 - Jul 4, 2014. In: 2014 IEEE International Symposium on Information Theory. Piscataway, NJ:IEEE, pp. 2909-2913. ISSN 2157-8095. eISSN 2157-8117. ISBN 978-1-4799-5186-4. Available under: doi: 10.1109/ISIT.2014.6875366

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

This item appears in the following Collection(s)

Search KOPS


Browse

My Account