File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A Randomized Algorithm for the Capacity of Finite-State Channels

TitleA Randomized Algorithm for the Capacity of Finite-State Channels
Authors
Issue Date2015
Citation
IEEE Transactions on Information Theory, 2015, v. 61, p. 3651-3669 How to Cite?
AbstractInspired by ideas from the field of stochastic approximation, we propose a ran- domized algorithm to compute the capacity of a finite-state channel with a Markovian input. When the mutual information rate of the channel is concave with respect to the chosen parameterization, the proposed algorithm proves to be convergent to the ca- pacity of the channel almost surely with the derived convergence rate. We also discuss the convergence behavior of the algorithm without the concavity assumption.
Persistent Identifierhttp://hdl.handle.net/10722/217072

 

DC FieldValueLanguage
dc.contributor.authorHan, G-
dc.date.accessioned2015-09-18T05:47:27Z-
dc.date.available2015-09-18T05:47:27Z-
dc.date.issued2015-
dc.identifier.citationIEEE Transactions on Information Theory, 2015, v. 61, p. 3651-3669-
dc.identifier.urihttp://hdl.handle.net/10722/217072-
dc.description.abstractInspired by ideas from the field of stochastic approximation, we propose a ran- domized algorithm to compute the capacity of a finite-state channel with a Markovian input. When the mutual information rate of the channel is concave with respect to the chosen parameterization, the proposed algorithm proves to be convergent to the ca- pacity of the channel almost surely with the derived convergence rate. We also discuss the convergence behavior of the algorithm without the concavity assumption.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Information Theory-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.titleA Randomized Algorithm for the Capacity of Finite-State Channels-
dc.typeArticle-
dc.identifier.emailHan, G: ghan@hku.hk-
dc.identifier.authorityHan, G=rp00702-
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/TIT.2015.2432094-
dc.identifier.hkuros253248-
dc.identifier.volume61-
dc.identifier.spage3651-
dc.identifier.epage3669-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats