An upper bound on the capacity of channels with memory and constraint input

Proceedings - 2001 IEEE Information Theory Workshop, ITW 2001

Volumn , Issue , 2001, Pages 147-149

  Vontobel, Pascal O ^a   Arnold, Dieter M ^b  

^a ETH ZURICH   (Switzerland)

^b IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY;

CHANNELS WITH MEMORY; FINITE STATE CHANNELS; MEMORYLESS CHANNELS; NUMERICAL RESULTS; TIME INVARIANTS; UPPER BOUND;

INFORMATION THEORY;

EID: 84938939155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ITW.2001.955166     Document Type: Conference Paper

References (8)

1. I. Csiszár and J. Körner, Information Theory. Budapest: Akadémiai Kiadó (Publishing House of the Hungarian Academy of Sciences), 1981. Coding theorems for discrete memoryless systems.
2. R. D. Cideciyan, F. Dolivo, R. Hermann, W. Hirt, and W. Scott, "A PRML System for Digital Magnetic Recording," IEEE J. Sel. Areas Comm., vol. 10, pp. 38-56, Jan. 1992.
3. S. Shamai and R. Laroia, "The Intersymbol Interference Channel: Lower Bounds on Capacity and Channel Precoding Loss," IEEE Trans, on Inform. Theory, vol. 42, pp. 1388-1404, Sept. 1996.
4. W. Hirt, Capacity and Information Rates of Discrete-Time Channels with Memory. PhD thesis, Swiss Federal Institute of Technology, ETH Zurich, October 1998.
5. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
6. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
7. D. Arnold, H.-A. Loeliger, "On the Information Rate of Binary-Input Channels with Memory," accepted for publication at ICC 2001, Helsinki. Available as IBM research report RZ3341 under http://domino.watson.ibm.com/library/Cyberdig.nsf/home.
8. A. Kavčić, "Capacity of Markov Sources over Noisy Channels," submitted to GLOBECOM 2001.