File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TIT.2015.2432094
- Scopus: eid_2-s2.0-84933555928
- WOS: WOS:000356301600004
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: A Randomized Algorithm for the Capacity of Finite-State Channels
Title | A Randomized Algorithm for the Capacity of Finite-State Channels |
---|---|
Authors | |
Keywords | capacity finite-state channel memory channel |
Issue Date | 2015 |
Citation | IEEE Transactions on Information Theory, 2015, v. 61, p. 3651-3669 How to Cite? |
Abstract | Inspired 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 Identifier | http://hdl.handle.net/10722/217072 |
ISSN | 2023 Impact Factor: 2.2 2023 SCImago Journal Rankings: 1.607 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Han, G | - |
dc.date.accessioned | 2015-09-18T05:47:27Z | - |
dc.date.available | 2015-09-18T05:47:27Z | - |
dc.date.issued | 2015 | - |
dc.identifier.citation | IEEE Transactions on Information Theory, 2015, v. 61, p. 3651-3669 | - |
dc.identifier.issn | 0018-9448 | - |
dc.identifier.uri | http://hdl.handle.net/10722/217072 | - |
dc.description.abstract | Inspired 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.language | eng | - |
dc.relation.ispartof | IEEE Transactions on Information Theory | - |
dc.subject | capacity | - |
dc.subject | finite-state channel | - |
dc.subject | memory channel | - |
dc.title | A Randomized Algorithm for the Capacity of Finite-State Channels | - |
dc.type | Article | - |
dc.identifier.email | Han, G: ghan@hku.hk | - |
dc.identifier.authority | Han, G=rp00702 | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/TIT.2015.2432094 | - |
dc.identifier.scopus | eid_2-s2.0-84933555928 | - |
dc.identifier.hkuros | 253248 | - |
dc.identifier.volume | 61 | - |
dc.identifier.spage | 3651 | - |
dc.identifier.epage | 3669 | - |
dc.identifier.eissn | 1557-9654 | - |
dc.identifier.isi | WOS:000356301600004 | - |
dc.identifier.issnl | 0018-9448 | - |