Causal coding of markov sources with continuous alphabets

Analysis and Design of Nonlinear Control Systems: In Honor of Alberto Isidori

Volumn , Issue , 2008, Pages 91-108

  Yüksel, Serdar ^a   Basar, Tamer ^b  

^a Yale University   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84870641565     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-74358-3_7     Document Type: Chapter

References (25)

1. E. Altman. Constrained Markov decision processes. Chapman & Hall/CRC, 1999.
2. R. Bansal and T. Başar. Simultaneous design of measurement and control strategies for stochastic systems with feedback. Automatica, 25:679-694, 1989.
3. P. Billingsley. Convergence of Probability Measures. John Wiley & Sons, New York, 1968.
4. V. S. Borkar, S. K. Mitter, and S. Tatikonda. Optimal sequential vector quantization of Markov sources. SIAM J. Contr. Optimization, 40:135-148, 2001.
5. P. Chigansky and R. Liptser. Stability of nonlinear filters in non-mixing case. Annals App. Prob., 14:2038-2056, 2004.
6. C. De Persis and A. Isidori. Stabilizability by state feedback implies stabilizability by encoded state feedback. Systems & Control Letters, 53:249-258, 2004.
7. N. Gaarder and D. Slepian. On optimal finite-state digital transmission systems. IEEE Transaction Information Theory, 28:167-186, 1982.
8. H. Gish and J. N. Pierce. Asymptotically efficient quantization. IEEE Transaction Information Theory, 14:676-683, 1968.
9. A. György and T. Linder. Optimal entropy-constrained scalar quantization of a uniform source. IEEE Transaction Information Theory, 46:2704-2711, 2000.
10. A. György and T. Linder. On the structure of optimal entropy constrained scalar quantizers. IEEE Transaction Information Theory, 48:416-427, 2002.
11. A. György, T. Linder, P. A. Chou, and B. J. Betts. Do optimal entropy constrained quantizers have a finite or infinite number of codewords? IEEE Transaction Information Theory, 49:3031-3037, 2003.
12. O. Hernandez-Lerma, J. Gonzales-Hernandez, and R. R. Lopez-Martinez. Constrained average cost Markov control processes in Borel spaces. SIAM J. Contr. Optimization, 42:442-468, 2003.
13. T. Kaijser. A limit theorem for partially observed Markov chains. Annals of Probability, 4:677-696, 1975.
14. T. Linder and R. Zamir. Causal coding of stationary sources and individual sequences with high resolution. IEEE Transaction Information Theory, 52(2):662-680, 2006.
15. D. G. Luenberger. Optimization by Vector Space Methods. John Wiley & Sons, New York, 1969.
16. S. P. Meyn. The policy iteration algorithm for average reward Markov decision processes with general state space. IEEE Trans. on Automat. Contr., 42:1663-1680, 1997.
17. S. P. Meyn and R. Tweedie. Markov Chains and Stochastic Stability. Springer Verlag, London, 1993.
18. D. L. Neuhoff and R. K. Gilbert. Causal source codes. IEEE Transaction Information Theory, 28:701-713, 1982.
19. K. W. Ross. Randomized and past-dependent policies for Markov decision processes with multiple constraints. Operations Research, 37:474-477, 1989.
20. S. Tatikonda. Control Under Communication Constraints. PhD thesis, MIT, Cambridge, 2000.
21. D. Teneketzis. Real-time encoding-decoding of Markov sources in noisy environments. Proc. of Mathematical Theory of Networks and Systems, 2004.
22. J. C. Walrand and P. Varaiya. Optimal causal coding-decoding problems. IEEE Transaction Information Theory, 19:814-820, 1983.
23. H. S. Witsenhausen. Separation of estimation and control for discrete time systems. Proceedi ngs o f the IEEE, 59:1557-1566, 1971.
24. H. S. Witsenhausen. On the structure of real-time source coders. Bell Syst. Tech. J., 58:1437-1451, 1979.
25. S. Yüksel and T. Başar. Minimum rate coding for LTI systems over noiseless channels. IEEE Trans. on Automat. Contr., 51(12):1878-1887, 2006.