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

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 349-

  Chen, Jiangxin ^a   Siegel, Paul H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL STATES; FINITE-STATE INTERSYMBOL INTERFERENCE CHANNELS; INFORMATION RATES;

APPROXIMATION THEORY; GAUSSIAN NOISE (ELECTRONIC); INFORMATION RETRIEVAL; INTERSYMBOL INTERFERENCE; MAGNETIC RECORDING; MARKOV PROCESSES; OPTIMIZATION; THEOREM PROVING;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 5044252304     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. H. D. Pfister, Joseph B. Soriaga, and P. H. Siegel, "On the achievable information rate of finite state ISI channels," in Proc. GLOBECOM 2001, San Antonio, TX, November 2001, vol. 5, pp. 2992-2996.
2. A. Kavčić, "On the capacity of Markov sources over noisy channels," in Proc. GLOBECOM 2001, San Antonio, TX, November 2001, vol. 5, pp. 2997-3001.
3. D. S. Ornstein, Ergodic Theory, Randomness and Dynamical Systems, Yale University Press, 1974.
4. L. Breiman, "Finite-state channels," Proc. 2nd Prague Conf. Inform. Theory , Stat. Decision Functions, Random Processes, Prague, Czechoslovak Academy, pp. 49-60, 1959.