Feedback capacity of finite-state machine channels

IEEE Transactions on Information Theory

Volumn 51, Issue 3, 2005, Pages 799-810

  Yang, Shaohua ^a,b   Kavčić, Aleksandar ^a   Tatikonda, Sekhar ^c  

^a HARVARD UNIVERSITY   (United States)

^b SAN JOSE RESEARCH CENTER   (United States)

^c Yale University   (United States)

Author keywords

Channel capacity; Delayed feedback capacity; Directed information rate; Dynamic programming; Feedback capacity; Finite state machine channels; Intersymbol interference; Partial response channels; Run length limited (RLL) sequences

Indexed keywords

ALGORITHMS; DYNAMIC PROGRAMMING; INTERSYMBOL INTERFERENCE; MARKOV PROCESSES; MATHEMATICAL MODELS; MONTE CARLO METHODS; OPTIMIZATION; PROBABILITY DENSITY FUNCTION; RANDOM PROCESSES; STOCHASTIC CONTROL SYSTEMS; THEOREM PROVING;

DELAYED FEEDBACK CAPACITY; DIRECTED INFORMATION RATE; FEEDBACK CAPACITY; FINITE STATE MACHINE CHANNELS; PARTIAL RESPONSE CHANNELS; RUN-LENGTH-LIMITED (RLL) SEQUENCES;

CHANNEL CAPACITY;

EID: 15044346227     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.842626     Document Type: Article

References (19)

1. C. E. Shannon, "The zero error capacity of a noisy channel," IRE Trans. Inf. Theory, vol. IT-2, no. 3, pp. 112-124, Sep. 1956.
2. S. Verdú, "Fifty years of Shannon theory," IEEE. Trans. Inf. Theory, vol. 44, no. 6, pp. 2057-2077, Oct. 1998.
3. J. L. Massey, "Causality, feedback and directed information," in Proc. 1990 Intl. Symp. Information Theory and Its Applications, Nov. 1990, pp. 27-30.
4. Control under communications constraints, S. Tatikonda. (2000).
5. W. M. Wonham, "Some applications of stochastic differential equations to optimal nonlinear filtering," SIAM J. Contr., vol. 2, pp. 347-368, 1965.
6. R. W. Chang and J. C. Hancock, "On receiver structures for channels having memory," IEEE. Trans. Inf. Theory, vol. IT-12, no. 4, pp. 463-468, Oct. 1966.
7. L. E. Baum and T. Petrie, "Statistical interference for probabilistic functions of finite state Markov chains," Ann. Math. Statist, vol. 37, pp. 1559-1563, 1966.
8. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inf. Theory, vol. IT-20, no. 5, pp. 284-287, Sep. 1974.
9. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
10. D. P. Bertsekas, Dynamic Programming and Optimal Control, 2nd ed. Belmont, MA: Athena Scientific, 2001.
11. D. Arnold and H.-A Loeliger, "On the information rate of binary-input channels with memory," in Proc. IEEE Int. Conf. Communications, Helsinki, Finland, Jun. 2001, pp. 2692-2695.
12. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rates of finite state ISI channels," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001, pp. 2992-2996.
13. A. Kavčić, "On the capacity of Markov sources over noisy channels," in Proc. IEEE GLOBECOM, San Antonio, TX, Nov. 2001, pp. 2997-3001.
14. K. A. S. Immink, P. H. Siegel, and J. K. Wolf, "Codes for digital recorders," IEEE Trans. Inf. Theory, vol. 44. no. 6, pp. 2260-2299, Oct. 1998.
15. R. G. Gallager, Discrete Stochastic Processes. Boston, MA: Kluwer Academic, 1996.
16. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
17. P. Kumar and P. Varaiya, Stochastic Systems: Estimation, Identification, and Adaptive Control. Englewood Cliffs, NJ: Prentice-Hall, 1986.
18. T. Berger and Y. Ying, "Characterizing optimum (input, output) processes for finite-state channels with feedback," in Proc. IEEE Int. Symp. Information Theory, Yokohoma, Japan, Jun./Jul. 2003, p. 117.
19. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York,: Wiley, 1991.