Capacity of partial response channels

Coding and Signal Processing for Magnetic Recording Systems

Volumn , Issue , 2004, Pages 13-1-13-19

  Yang, Shaohua ^a   Kavčić, Aleksandar ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 40949137442     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (31)

1. K. A. S. Immink, P. H. Siegel, and J. K. Wolf, “Codes for digital recorders, ” IEEETrans. Inform. Theory, vol. 44, pp. 2260-2299, October 1998.
2. D. Arnold and H. -A. Loeliger, “On the information rate of binary-input channels with memory, ” in Proc. IEEE ICC 2001, Helsinki, Finland, pp. 2692-2695, June 2001.
3. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, “On the achievable information rates of finite state ISI channels, ” in Proc. IEEE GLOBECOM 2001, San Antonio, Texas, pp. 2992-2996, November 2001.
4. V. Sharmaand, S. K. Singh, “Entropy and channel capacity in the regenerative setupwith applications to Markov channels, ” in Proc. IEEE ISIT 2001, Washington, DC, p. 283, June 2001.
5. A. Kavčić, “On the capacity of Markov sources over noisy channels, ” in Proc. IEEE GLOBECOM 2001, San Antonio, Texas, pp. 2997-3001, November 2001.
6. S. Yang, A. Kavčić, and S. Tatikonda, “Delayed feedback capacity of finite-state machine channels: Upper bounds on the feedforward capacity, ” in IEEE ISIT 2003, Yokohoma, Japan, July 2003.
7. Z. Zhang and T. Duman, “Information theory of magnetic recording channels. ” anothermonograph in this book.
8. J. G. Proakis, Digital Communications. McGraw-Hill, New York, 4th ed., 2000.
9. T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley & Sons, New York, 1991.
10. C. E. Shannon, “A mathematical theory of communications, ” Bell Syst. Tech. J., vol. 27, pp. 379-423 (part I) and 623-656 (part II), 1948.
11. X. Ma, A. Kavčić, and N. Varnica, “Matched information rate codes for partial response channels. ” submitted to IEEE Transactions on Information Theory, June 2002.
12. R. G. Gallager, Low-Density Parity-Check Codes. MIT Press, Cambridge, MA, 1962.
13. C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shannon limit error-correcting coding and decoding: Turbo-codes, ” in Proc. IEEE Int. Conf. on Communications, Geneva, Switzerland, pp. 1064-1070, May 1993.
14. R. W. Chang and J. C. Hancock, “On receiver structures for channels having memory, ” IEEE. Trans. Inform. Theory, vol. 12, pp. 463-468, October 1966.
15. 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.
16. L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, “Optimal decoding of linear codes for minimizing symbol error rate, ” IEEE Trans. Inform. Theory, vol. 20, pp. 284-287, September 1974.
17. F. R. Kschischang, B. J. Frey, and H. -A. Loeliger, “Factor graphs and the sum-product algorithm, ” IEEE Trans. Info. Theory, vol. 47, pp. 498-519, February 2001.
18. P. O. Vontobel, “A generalized blahut-arimoto algorithm, ” in Proc. IEEE ISIT 2003, Yokohama, Japan, July 2003.
19. S. C. Tatikonda, Control Under Communications Constraints. Ph. D. thesis, Massachusetts Institute of Technology, Cambridge, MA, September 2000. available at http://pantheon.yale.edu/~sct29/thesis.html.
20. J. L. Massey, “Causality, feedback and directed information, ” in Proc. 1990 Intl. Symp. on Info. Th. and its Appli., pp. 27-30, November 1990.
21. S. Yang and A. Kavčić, “Sum-product algorithm and feedback capacity, ” in Proc. Int. Symp. Math. Theory Networks Sys., South Bend, Indiana, August 2002. available at http://hrl.harvard.edu/~kavcic/publications.html.
22. S. Yang, A. Kavčić, and S. Tatikonda, “The feedback capacity of finite-state machine channels. ” Submitted to IEEE Trans. Inform. Theory, December 2002.
23. D. P. Bertsekas, Dynamic Programming and Optimal Control 2nd ed., vol. 1, Athena Scientific, Belmont, MA, 2001.
24. A. D. Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm, ” IEEE Trans. Info. Theory, vol. 13, pp. 260-269, April 1967.
25. G. D. Forney Jr., “Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference, ” IEEE Trans. Info. Theory, vol. 18, pp. 363-378, March 1972.
26. D. Arnold and E. Eleftheriou, “Onthe information-theoretic capacity of magnetic recording systems in the presence of medium noise, ” IEEE Trans. Magn., vol. 38, pp. 2319-2321, September 2002.
27. S. Yang and A. Kavčić, “On the capacity of data-dependent autoregressive noise channels, ” in Proc. Allerton Conf. Commn. Control, 2002.
28. W. Ryan, “Optimal code rates for Lorentzian channel models” in Proc. IEEE ICC 2003, (Anchorage, AK), May 2003.
29. S. Yang, A. Kavčić, and W. Ryan, “Optimizing the Bit Aspect Ratio of a recording system using an Information-theoretic criterion, ” in IEEE INTERMAG 2003, Boston, Massachusetts, April 2003.
30. D. Arnold and H. -A. Loeliger, “On finite-state information rates from channel simulations, ” in Proc. IEEE ISIT 2002, Lausanne, Switzerland, p. 164, July 2002.
31. D. Arnold, A. Kavčić, H. -A. Loeliger, P. O. Vontobel, and W. Zeng, “Simulation based computation of information rates: Upper and lower bounds, ” Yokohama, Japan, July 2003.