Efficient approximation of discrete memoryless channel capacities

Cite This

Files in this item

Files Size Format View

There are no files associated with this item.

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

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

This item appears in the following Collection(s)

Search KOPS


Browse

My Account