File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ISIT.2013.6620598
- Scopus: eid_2-s2.0-84890326501
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: A randomized approach to the capacity of finite-state channels
| Title | A randomized approach to the capacity 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. 2109-2113 How to Cite? |
| Abstract | Inspired by the ideas from the field of stochastic approximation, we propose a randomized 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, we show that, at least for some practical channels, the proposed algorithm will converge to the capacity almost surely. |
| Persistent Identifier | http://hdl.handle.net/10722/189947 |
| ISBN | |
| ISSN | 2020 SCImago Journal Rankings: 0.600 |
| DC Field | Value | Language |
|---|---|---|
| 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. 2109-2113 | en_US |
| dc.identifier.isbn | 9781479904464 | - |
| dc.identifier.issn | 2157-8095 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/189947 | - |
| dc.description.abstract | Inspired by the ideas from the field of stochastic approximation, we propose a randomized 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, we show that, at least for some practical channels, the proposed algorithm will converge to the capacity almost surely. | - |
| 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 | A randomized approach to the capacity 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.6620598 | - |
| dc.identifier.scopus | eid_2-s2.0-84890326501 | - |
| dc.identifier.hkuros | 221292 | en_US |
| dc.identifier.spage | 2109 | - |
| dc.identifier.epage | 2113 | - |
| dc.publisher.place | Institute of Electrical and Electronics Engineers | - |
| dc.identifier.issnl | 2157-8095 | - |