File Download
There are no files associated with this item.
Supplementary
-
Citations:
- Appears in Collections:
Conference Paper: A Randomized Algorithm for the Capacity of Finite-state Channels
| Title | A Randomized Algorithm for the Capacity of Finite-state Channels |
|---|---|
| Authors | |
| Issue Date | 2016 |
| Citation | Workshop on Core and Frontier of Information Theory, University of Science and Technology of China, Hefei, China, 11-12 June 2016
How to Cite? |
| Abstract | Inspired by 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, the proposed algorithm proves to be convergent to the capacity 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/236605 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Han, G | - |
| dc.date.accessioned | 2016-11-30T09:36:58Z | - |
| dc.date.available | 2016-11-30T09:36:58Z | - |
| dc.date.issued | 2016 | - |
| dc.identifier.citation | Workshop on Core and Frontier of Information Theory, University of Science and Technology of China, Hefei, China, 11-12 June 2016 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/236605 | - |
| dc.description.abstract | Inspired by 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, the proposed algorithm proves to be convergent to the capacity 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 | Workshop on Core and Frontier of Information Theory, 2016 | - |
| dc.title | A Randomized Algorithm for the Capacity of Finite-state Channels | - |
| dc.type | Conference_Paper | - |
| dc.identifier.email | Han, G: ghan@hku.hk | - |
| dc.identifier.authority | Han, G=rp00702 | - |
| dc.identifier.hkuros | 267596 | - |