Efficient Approximation of Channel Capacities

No Thumbnail Available
Files
There are no files associated with this item.
Date
2015
Authors
Sutter, David
Esfahani, Peyman Mohajerin
Lygeros, John
Editors
Contact
Journal ISSN
Electronic ISSN
ISBN
Bibliographical data
Publisher
Series
URI (citable link)
DOI (citable link)
ArXiv-ID
International patent number
Link to the license
EU project number
Project
Open Access publication
Restricted until
Title in another language
Research Projects
Organizational Units
Journal Issue
Publication type
Journal article
Publication status
Published
Published in
IEEE Transactions on Information Theory ; 61 (2015), 4. - pp. 1649-1666. - IEEE. - ISSN 0018-9448. - eISSN 1557-9654
Abstract
We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. The presented method requires O(M 2 N√log N/ε) to provide an estimate of the capacity to within ε, where N and M denote the input and output alphabet size; a single iteration has a complexity O(MN). We also show how to approximately compute the capacity of memoryless channels having a bounded continuous input alphabet and a countable output alphabet under some mild assumptions on the decay rate of the channel's tail. It is shown that discrete-time Poisson channels fall into this problem class. As an example, we compute sharp upper and lower bounds for the capacity of a discrete-time Poisson channel with a peak-power input constraint.
Summary in another language
Subject (DDC)
004 Computer Science
Keywords
Conference
Review
undefined / . - undefined, undefined. - (undefined; undefined)
Cite This
ISO 690SUTTER, Tobias, David SUTTER, Peyman Mohajerin ESFAHANI, John LYGEROS, 2015. Efficient Approximation of Channel Capacities. In: IEEE Transactions on Information Theory. IEEE. 61(4), pp. 1649-1666. ISSN 0018-9448. eISSN 1557-9654. Available under: doi: 10.1109/TIT.2015.2401002
BibTex
@article{Sutter2015Effic-55748,
  year={2015},
  doi={10.1109/TIT.2015.2401002},
  title={Efficient Approximation of Channel Capacities},
  number={4},
  volume={61},
  issn={0018-9448},
  journal={IEEE Transactions on Information Theory},
  pages={1649--1666},
  author={Sutter, Tobias and Sutter, David and Esfahani, Peyman Mohajerin 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/55748">
    <dc:contributor>Lygeros, John</dc:contributor>
    <dc:language>eng</dc:language>
    <dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
    <dcterms:title>Efficient Approximation of Channel Capacities</dcterms:title>
    <foaf:homepage rdf:resource="http://localhost:8080/"/>
    <dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T13:49:47Z</dc:date>
    <dc:creator>Lygeros, John</dc:creator>
    <dc:creator>Sutter, Tobias</dc:creator>
    <dc:contributor>Esfahani, Peyman Mohajerin</dc:contributor>
    <void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
    <dc:contributor>Sutter, Tobias</dc:contributor>
    <bibo:uri rdf:resource="https://kops.uni-konstanz.de/handle/123456789/55748"/>
    <dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:contributor>Sutter, David</dc:contributor>
    <dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
    <dc:creator>Esfahani, Peyman Mohajerin</dc:creator>
    <dcterms:issued>2015</dcterms:issued>
    <dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2021-12-02T13:49:47Z</dcterms:available>
    <dc:rights>terms-of-use</dc:rights>
    <dcterms:abstract xml:lang="eng">We propose an iterative method for approximately computing the capacity of discrete memoryless channels, possibly under additional constraints on the input distribution. Based on duality of convex programming, we derive explicit upper and lower bounds for the capacity. The presented method requires O(M &lt;sub&gt;2&lt;/sub&gt; N√log N/ε) to provide an estimate of the capacity to within ε, where N and M denote the input and output alphabet size; a single iteration has a complexity O(MN). We also show how to approximately compute the capacity of memoryless channels having a bounded continuous input alphabet and a countable output alphabet under some mild assumptions on the decay rate of the channel's tail. It is shown that discrete-time Poisson channels fall into this problem class. As an example, we compute sharp upper and lower bounds for the capacity of a discrete-time Poisson channel with a peak-power input constraint.</dcterms:abstract>
    <dc:creator>Sutter, David</dc:creator>
  </rdf:Description>
</rdf:RDF>
Internal note
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Contact
URL of original publication
Test date of URL
Examination date of dissertation
Method of financing
Comment on publication
Alliance license
Corresponding Authors der Uni Konstanz vorhanden
International Co-Authors
Bibliography of Konstanz
No
Refereed
Yes