File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISIT.2013.6620599
- Scopus: eid_2-s2.0-84890365477
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Concavity of mutual information rate of finite-state channels
Title | Concavity of mutual information rate of finite-state channels |
---|---|
Authors | |
Issue Date | 2013 |
Publisher | Institute 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? |
Abstract | The 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 Identifier | http://hdl.handle.net/10722/189946 |
ISBN | |
ISSN | 2023 SCImago Journal Rankings: 0.696 |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Li, Y | en_US |
dc.contributor.author | Han, G | en_US |
dc.date.accessioned | 2013-09-17T15:03:47Z | - |
dc.date.available | 2013-09-17T15:03:47Z | - |
dc.date.issued | 2013 | en_US |
dc.identifier.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 | en_US |
dc.identifier.isbn | 9781479904464 | - |
dc.identifier.issn | 2157-8095 | - |
dc.identifier.uri | http://hdl.handle.net/10722/189946 | - |
dc.description.abstract | The 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.language | eng | en_US |
dc.publisher | Institute 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.ispartof | IEEE International Symposium on Information Theory. Proceedings | en_US |
dc.title | Concavity of mutual information rate of finite-state channels | en_US |
dc.type | Conference_Paper | en_US |
dc.identifier.email | Han, G: ghan@hku.hk | en_US |
dc.identifier.authority | Han, G=rp00702 | en_US |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ISIT.2013.6620599 | - |
dc.identifier.scopus | eid_2-s2.0-84890365477 | - |
dc.identifier.hkuros | 221291 | en_US |
dc.identifier.spage | 2114 | - |
dc.identifier.epage | 2118 | - |
dc.publisher.place | Institute of Electrical and Electronics Engineers | - |
dc.identifier.issnl | 2157-8095 | - |