Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels

IEEE Transactions on Information Theory

Volumn 54, Issue 3, 2008, Pages 1295-1303

  Chen, Jiangxin ^a,b   Siegel, Paul H ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Prediction Company   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Capacity; Finite state channels; Intersymbol interference (ISI) channels; Markov processes; Run length limited constraints; Two dimensional channels

Indexed keywords

CHANNEL CAPACITY; COMPUTER SIMULATION; INTERSYMBOL INTERFERENCE; MARKOV PROCESSES;

BINARY-SYMMETRIC CHANNEL; FINITE-STATE CHANNELS; RUN-LENGTH LIMITED CONSTRAINTS;

CHANNEL STATE INFORMATION;

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

References (28)

1. W. Hirt and J. L. Massey, "Capacity of the discrete-time Gaussian channel with intersymbol interference," IEEE Trans. Inf. Theory, vol. 34, no. 3, pp. 380-388, May 1988.
2. D. M. 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, vol. 9, pp. 2692-2695.
3. V. Sharma and S. K. Singh, "Entropy and channel capacity in the regenerative setup with applications to Markov channels," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 283.
4. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rate of finite state ISI channels," in Proc. GLOBECOM 2001, San Antonio, TX, Nov. 2001, vol. 5, pp. 2992-2996.
5. D. M. Arnold, 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.
6. 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. 2, pp. 284-287, Mar. 1974.
7. S. Yang and A. Kavčić, "Capacity of partial response channels," in Handbook of Coding and Signal Processing for Magnetic Recording Systems. Boca Raton, FL: CRC, 2004, ch. 13.
8. P. O. Vontobel, A. Kavčić, D. Arnold, and H.-A. Loeliger, "A generalization of the Blahut-Arimoto algorithm to finite-state channels," IEEE Trans. Inf. Theory, to be published.
9. J. B. Soriaga and P. H. Siegel, "On near-capacity coding systems for partial response channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 267.
10. A. Kavčić, X. Ma, and N. Varnica, "Matched information rate codes for partial response channels," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 973-989, Mar. 2005.
11. N. Varnica, X. Ma, and A. Kavčić, "Capacity approaching codes for partial response channels," in Handbook of Coding and Signal Processing for Magnetic Recording Systems. Boca Raton, FL: CRC, 2004, ch. 23.
12. D. Blackwell, L. Breiman, and A. J. Thomasian, "Proof of Shannon's theorem for finite-state indecomposable channels," Ann. Math. Statist., vol. 29, no. 4, pp. 1209-1220, Dec. 1958.
13. P. O. Vontobel and D. M. Arnold, "An upper bound on the capacity of the channels with memory and constraint input," in Proc. IEEE Information Theory Workshop, Cairns, Australia, Sep. 2001, pp. 147-149.
14. S. Yang, A. Kavčić, and S. Tatikonda, "The feedback capacity of finite-state machine channels," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 799-810, Mar. 2005.
15. S. Shamai (Shitz) and Y. Kofman, "On the capacity of binary and Gaussian channels with run-length-limited inputs," IEEE Trans. Inf. Theory, vol. 38, no. 3, pp. 584-594, May 1990.
16. S. Verdú and T. S. Han, "A general formula for channel capacity," IEEE Trans. Inf. Theory, vol. 40, no. 4, pp. 1147-1157, Jul. 1994.
17. A. Feinstein, "On the coding theorem and its converse for finite memory channels," Inf. Contr., vol. 2, no. 1, pp. 25-44, 1959.
18. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
19. D. S. Ornstein, Ergodic Theory, Randomness and Dynamical Systems. New Haven, CT: Yale Univ. Press, 1974.
20. L. Breiman, "Finite-state channels," in Proc. 2nd Prague Conf. Information Theory, Statistical Decision Functions, Random Processes, Prague, Czechoslovakia, 1959, pp. 49-60.
21. D. Psaltis and F. Mok, "Holographic memories," Scient. Amer., pp. 70-76, Nov. 1995.
22. H. O. Georgii, Gibbs Measures and Phase Transitions. Berlin, Germany: DeGruyter, vol. 9, Studies in Mathematics.
23. D. N. Politis, "Markov chain in many dimensions," Adv. Appl. Probab., vol. 26, pp. 756-774, 1994.
24. Y. Katznelson and B. Weiss, "Commuting measure-preserving transformations," Israel J. Math., vol. 12, pp. 161-173, 1972.
25. D. Anastassiou and D. J. Sakrison, "Some results regarding the entropy rates of random fields," IEEE Trans. Inf. Theory, vol. IT-28, no. 2, pp. 340-343, Mar. 1982.
26. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
27. J. Chen and P. H. Siegel, "Markov processes asymptotically achieve the capacity of finite-state intersymbol interference channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 349.
28. R. Kindermann and J. L. Snell, Markov Random Fields and Their Applications. Providence, RI: Amer. Math. Soc., 1980, vol. 1, Contemporary Mathematics.