File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Concavity of mutual information rate of finite-state channels

TitleConcavity of mutual information rate of finite-state channels
Authors
Issue Date2013
PublisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369
Citation
The 2013 IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey, 7 -12 July 2013. In The 2013 IEEE International Symposium on Information (ISIT) Theory Proceedings, 2013, p. 2114-2118 How to Cite?
AbstractThe computation of the capacity of a finite-state channel (FSC) is a fundamental and long-standing open problem in information theory. The capacity of a memoryless channel can be effectively computed via the classical Blahut-Arimoto algorithm (BAA), which, however, does not apply to a general FSC. Recently Vontobel et al. [1] generalized the BAA to compute the capacity of a finite-state machine channel with a Markovian input. Their proof of the convergence of this algorithm, however, depends on the concavity conjecture posed in their paper. In this paper, we confirm the concavity conjecture for some special FSCs. On the other hand, we give examples to show that the conjecture is not true in general.
Persistent Identifierhttp://hdl.handle.net/10722/189946
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorLi, Yen_US
dc.contributor.authorHan, Gen_US
dc.date.accessioned2013-09-17T15:03:47Z-
dc.date.available2013-09-17T15:03:47Z-
dc.date.issued2013en_US
dc.identifier.citationThe 2013 IEEE International Symposium on Information Theory (ISIT), Istanbul, Turkey, 7 -12 July 2013. In The 2013 IEEE International Symposium on Information (ISIT) Theory Proceedings, 2013, p. 2114-2118en_US
dc.identifier.isbn9781479904464-
dc.identifier.issn2157-8095-
dc.identifier.urihttp://hdl.handle.net/10722/189946-
dc.description.abstractThe computation of the capacity of a finite-state channel (FSC) is a fundamental and long-standing open problem in information theory. The capacity of a memoryless channel can be effectively computed via the classical Blahut-Arimoto algorithm (BAA), which, however, does not apply to a general FSC. Recently Vontobel et al. [1] generalized the BAA to compute the capacity of a finite-state machine channel with a Markovian input. Their proof of the convergence of this algorithm, however, depends on the concavity conjecture posed in their paper. In this paper, we confirm the concavity conjecture for some special FSCs. On the other hand, we give examples to show that the conjecture is not true in general.-
dc.languageengen_US
dc.publisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000369-
dc.relation.ispartofIEEE International Symposium on Information Theory. Proceedingsen_US
dc.rightsIEEE International Symposium on Information Theory. Proceedings. Copyright © Institute of Electrical and Electronics Engineers.-
dc.rights©2013 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.titleConcavity of mutual information rate of finite-state channelsen_US
dc.typeConference_Paperen_US
dc.identifier.emailHan, G: ghan@hku.hken_US
dc.identifier.authorityHan, G=rp00702en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/ISIT.2013.6620599-
dc.identifier.scopuseid_2-s2.0-84890365477-
dc.identifier.hkuros221291en_US
dc.identifier.spage2114-
dc.identifier.epage2118-
dc.publisher.placeInstitute of Electrical and Electronics Engineers-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats