Upper bounds on the capacities of non-controllable finite-state channels using dynamic programming methods

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2009, Pages 2346-2350

  Huang, Xiujie ^a   Kavčić, Aleksandar ^b   Ma, Xiao ^a   Mandic, Danilo ^c  

^a SUN YAT SEN UNIVERSITY   (China)

^b University of Hawaii at Manoa   (United States)

^c IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL STATE; CONTROL CHANNELS; DELAYED FEEDBACK; DYNAMIC PROGRAMMING METHODS; FINITE-STATE; PROBABILITY LAW; STATE INFORMATION; UPPER BOUND;

DYNAMIC PROGRAMMING; INFORMATION THEORY; SOLAR CONCENTRATORS; SYSTEMS ENGINEERING; WIRELESS TELECOMMUNICATION SYSTEMS;

STATE FEEDBACK;

EID: 70449512446     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205962     Document Type: Conference Paper

References (17)

1. D. Arnold and H.-A. Loeliger, "On the information rate of binary-input channels with memory," in Proc. 2001 1EEE 1nt. Con! Communication,vol. 9, Helsinki, Finland, Jun. 2001, pp. 2692-2695.
2. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rates of finite state lSI channels," in Proc. IEEE GLOBECOM'01,vol. 5, San Antonio, Texas, Nov. 25-29 2001, pp. 2992-2996.
3. V. Sharma and S. K. Singh, "Entropy and channel capacity in the regenerative setup with applications to Markov channels," in Proc. 1EEE Intern. Symp. on Inform. Theory,Washington, D.C., Jun. 24-29 2001, p.283.
4. D. M. Aronld, H.-A. Loeliger, P. O. Vontobel, A. Kavčić, and W. Zeng, "Simulation-based computation of information rates for channels with memory," IEEE Trans. Inf. Theory,vol. 52, no. 8, pp. 3498-3508, Aug. 2006.
5. A. Kavčić, "On the capacity of Markov sources over noisy channels," in Proc. IEEE GLOBECOM'01,vol. 5, San Antonio, TX, USA, Nov. 25-29 2001, pp. 2997-3001.
6. P. O. Vontobel, A. Kavcic, D. M. Arnold, and H.-A. Loeliger, "A generalization of the Blahut-Arimoto algorithm to finite-state channels," IEEE Trans. Inform. Theory,vol. 54, no. 5, pp. 1887-1918, May 2008.
7. J. Chen and P. H. Siegel, "Markov processes asymptotially achieve the apacity of finite state intersymbol interference channels," in Proc. IEEE Intern. Symp. on Inform. Theory,Chicago, IL, USA, Jun 27-Jul 2 2004, p.346.
8. -, "Markov processs asymptotically achieve the capacity of finite state intersymbol interference channels," IEEE Trans. Inf. Theory,vol. 54, no. 3, pp. 1295-1303, Mar. 2008.
9. P. O. Vontobel and D. Arnold, "An upper bound on the capacity of channels with memory and constraint input," in Proc. 2001 IEEE ITW,Cairns, Australia, Sept. 2-7 2001, pp. 147-149.
10. S. Yang, A. Kavčić, and S. Tatikonda, "Feedback capacity of finite-state machine channels," IEEE Trans. Inf. Theory,vol. 51, no. 3, pp. 799-810, Mar. 2005.
11. R. G. Gallager, Information Theory and Relliable Communication.New York: John Wiley and Sons, Inc, 1968.
12. M. Mushkin and I. Bar-David, "Capacity and coding for the GilbertElliott channels," IEEE Trans. Inf. Theor,vol. IT-35, no. 6, pp. 12771290, Nov. 1989.
13. A. J. Goldsmith and P. P. Varaiya, "Capacity, mutual information, and coding for finite-state Markov channels," IEEE Trans. Inf. Theory,vol. 42, no. 3, pp. 868-886, May 1996.
14. D. P. Bertsekas, Dynamic Programming and Optimal Control,2nd ed. Belmont, MA: Athena Scientific, 2001.
15. J. L. Massey, "Causality, feedback and directed information," in Proc. 1990 IntI. Symp. In! Theory and its Applications,Waikiki, Hawaii, USA, Nov. 27-30 1990, pp. 303-305.
16. S. Tatikonda, "Control under communications constraints," Ph.D thesis, Massachusetts Inst. of Technology, Cambridge, MA, Sept. 2000.
17. L. R. Bahl, J. Cocke, F. Jelinek, and 1. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory,vol. IT-20, no. 2, pp. 284-287, Mar. 1974.