A randomized approach to the capacity of finite-state channels

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2013, Pages 2109-2113

  Han, Guangyue ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

FINITE-STATE CHANNELS; MARKOVIAN; MUTUAL INFORMATION RATES; RANDOMIZED ALGORITHMS; RANDOMIZED APPROACH; STOCHASTIC APPROXIMATIONS;

INFORMATION THEORY;

ALGORITHMS;

EID: 84890326501     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620598     Document Type: Conference Paper

References (35)

1. D. M. Arnold and H.-A. Loeliger. The information rate of binary-input channels with memory. IEEE ICC, pp. 2692-2695, 2001.
2. D. M. Arnold, H.-A. Loeliger, P. O. Vontobel, A. Kavcic, W. Zeng, Simulation-based computation of information rates for channels with memory. IEEE Trans. Info. Theory, vol. 52, no. 8, pp. 3498-3508, 2006.
3. A. Benveniste, M. Metivier and P. Priouret. Adaptive Algorithms and Stochastic Approximations, Springer-Verlag, 1990.
4. S. Bernstein. Sur l'extension du th́eoreme limite du calcul des probabilit́es aux sommes de quantit́es d́ependantes. Mathematische Annalen, vol. 97, pp. 1-59, 1927.
5. M. Boyle and K. Petersen. Hidden Markov processes in the context of symbolic dynamics. Entropy of Hidden Markov Processes and Connections to Dynamical Systems, London Mathematical Society Lecture Note Series, vol. 385, pp. 5-71, 2011.
6. R. Bradley. Introduction to Strong Mixing Conditions. Volumes 1, 2 and 3. Kendrick Press, 2007.
7. G. D. Forney, Jr. Maximum likelihood sequence estimation of digital sequences in the presence of inter-symbol interference. IEEE Trans. Info. Theory, vol. 18, no. 3, pp. 363-378, 1972.
8. A. Goldsmith and P. Varaiya. Capacity, mutual information, and coding for finite-state Markov channels. IEEE Trans. Info. Theory, vol. 42, no. 3, pp. 868-886, 1996.
9. G. Han. Limit theorems in hidden Markov models. To appear in IEEE Trans. Info. Theory.
10. G. Han and B. Marcus. Analyticity of entropy rate of hidden Markov chains. IEEE Trans. Info. Theory, vol. 52, no. 12, pp. 5251-5266, 2006.
11. G. Han and B. Marcus. Derivatives of entropy rate in special families of hidden Markov chains. IEEE Trans. Info. Theory, vol. 53, no. 7, pp. 2642-2652, 2007.
12. G. Han and B. Marcus. Asymptotics of input-constrained binary symmetric channel capacity. Annals of Applied Probability, vol. 19, no. 3, pp. 1063-1091, 2009.
13. G. Han and B. Marcus. Asymptotics of entropy rate in special families of hidden Markov chains. IEEE Trans. Info. Theory, vol. 56, no. 3, pp. 1287-1295, 2010.
14. G. Han and B. Marcus. Concavity of the mutual information rate for input-restricted memoryless channels at high SNR. IEEE Trans. Info. Theory, vol. 58, no. 3, pp. 1534-1548, 2012.
15. T. Holliday, A. Goldsmith, and P. Glynn. Capacity of finite state channels based on Lyapunov exponents of random matrices. IEEE Trans. Info. Theory, vol. 52, no. 8, pp. 3509-3532, 2006.
16. P. Jacquet, G. Seroussi, and W. Szpankowski. On the entropy of a hidden Markov process. Theoretical Computer Science, vol. 395, pp. 203-219, 2008.
17. H. Kushner and G. Yin. Stochastic Approximation Algorithms and Applications, Springer-Verlag, New York, 1997.
18. L. Ljung. System Identification: Theory for the User, 2nd edition, Prentice Hall, 1999.
19. D. Lind and B. Marcus. An introduction to symbolic dynamics and coding, Cambridge University Press, 1995.
20. B. Marcus, R. Roth and P. H. Siegel. Constrained systems and coding for recording channels. Handbook of Coding Theory, Elsevier Science, 1998.
21. M. Mushkin and I. Bar-David. Capacity and coding for the Gilbert-Elliott channel. IEEE Trans. Info. Theory, vol. 5, no. 6, pp. 1277-1290, 1989.
22. C. Nair, E. Ordentlich and T. Weissman. Asymptotic filtering and entropy rate of a hidden Markov process in the rare transitions regime. IEEE ISIT, pp. 1838-1842, 2005.
23. E. Ordentlich and T. Weissman. New bounds on the entropy rate of hidden Markov processes. IEEE ITW, pp. 117-122, 2004.
24. Y. Peres and A. Quas. Entropy rate for hidden Markov chains with rare transitions. Entropy of Hidden Markov Processes and Connections to Dynamical Systems, London Mathematical Society Lecture Note Series, vol. 385, pp. 172-178, 2011.
25. H. D. Pfister, J. Soriaga and P. H. Siegel. The achievable information rates of finite-state ISI channels. IEEE GLOBECOM, pp. 2992-2996, 2001.
26. H. D. Pfister. On the capacity of finite state channels and the analysis of convolutional accumulate-m codes. Ph. D. Thesis, University of California at San Diego, USA, 2003.
27. J. Proakis. Digital Communications, 4th ed. McGraw-Hill, New York, 2000.
28. S. Shamai (Shitz) and Y. Kofman. On the capacity of binary and Gaussian channels with run-length limited inputs. IEEE Trans. Commun., vol. 38, pp. 584-594, 1990.
29. V. Sharma and S. Singh. Entropy and channel capacity in the regenerative setup with applications to Markov channels. IEEE ISIT, pp. 283, 2001.
30. W. Stout. Almost sure convergence, New York, Academic Press, 1974.
31. V. Tadic. Analyticity, Convergence, and Convergence Rate of Recursive Maximum-Likelihood Estimation in Hidden Markov Models. IEEE Trans. Info. Theory, vol. 56, no, 12, pp. 6406-6432, 2010.
32. P. O. Vontobel, A. Kavcic, D. Arnold and H.-A. Loeliger. A generalization of the Blahut-Arimoto algorithm to finite-state channels. IEEE Trans. Info. Theory, vol. 54, no. 5, pp. 1887-1918, 2008.
33. E. Yang and J. Meng. Non-asymptotic equipartition properties for independent and identically distributed sources. Preprint, available at http://ita. ucsd. edu/workshop/12/files/paper/paper 306. pdf.
34. E. Zehavi and J. Wolf. On runlength codes. IEEE Trans. Info. Theory, vol. 34, no. 1, pp. 45-54, 1988.
35. O. Zuk, I. Kanter and E. Domany. The entropy of a binary hidden Markov process. J. Stat. Phys., vol. 121, no. 3-4, pp. 343-360, 2005.