Capacity-approaching codes for partial response channels

Coding and Signal Processing for Magnetic Recording Systems

Volumn , Issue , 2004, Pages 23-1-23-21

  Varnica, Nedeljko ^a   Ma, Xiao ^a   Kavčić, Aleksandar ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (44)

1. W. Hirt, Capacity and Information Rates of Discrete-Time Channels with Memory. Ph. D. thesis, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 1988.
2. S. Shamai (Shitz), L. H. Ozarow, and A. D. Wyner, Information rates for a discrete-time Gaussian channel with intersymbol interference and stationary inputs, IEEE Trans. Inform. Theory, vol. 37, pp. 1527-1539, 1991.
3. S. Shamai (Shitz) and S. Verdú, Worst-case power-constrained noise for binary-input channels, IEEE Trans. Inform. Theory, vol. 38, pp. 1494-1511, 1992.
4. 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.
5. A. S. Khayrallah and D. L. Neuhoff, Coding for channels with cost constraints, IEEE Trans. Inform. Theory, vol. 42, pp. 854-867, May 1996.
6. E. Zehavi and J. K. Wolf, On runlength codes, IEEE Trans. Inform. Theory, vol. 34, pp. 45-54, January 1988.
7. B. Marcus, K. Petersen, and S. Williams, Transmission rates and factors of Markov chains, Contemporary Mathematics, vol. 26, pp. 279-293, 1984.
8. S. Yang and A. Kavčić, Capacity of partial response channels, Chapter 13.
9. D. Arnold and H. -A. Loeliger, On the information rate of binary-input channels with memory, in Proceedings’ IEEE International Conference on Communications 2001, Helsinki, Finland, June 2001.
10. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, On the achievable information rates of finite state ISI channels, in Proceedings IEEE Globecom 2001, San Antonio, Texas, pp. 2992-2996, November 2001.
11. A. Kavčić, On the capacity of Markov sources over noisy channels, in Proceedings IEEE Global Communications Conference 2001, San Antonio, Texas, pp. 2997-3001, November 2001.
12. P. Vontobel and D. M. Arnold, An upper bound on the capacity of channels with memory and constraint input, in IEEE Information Theory Workshop, Cairns, Australia, September 2001.
13. S. Yang and A. Kavčić, Markov sources achieve the feedback capacity of finite-state machine channels, in Proceedings of IEEE International Symposium on Inform. Theory, Lausanne, Switzerland, July 2002.
14. C. Berrou, A. Glavieux, and P. Thitimajshima, Near Shannon limit error-correcting coding and decoding: Turbo-codes, in Proceedings IEEE International Conference on Communications, pp. 1064-1070, May 1993.
15. J. K. Wolf and G. Ungerboeck, Trellis coding for partial-response channels, ” IEEE Trans. Commun., vol. 34, pp. 744-765, March 1986.
16. A. R. Calderbank, C. Heegard, and T. A. Lee, Binary convolutional codeswith application to magnetic recording, IEEE J. Select. Areas Commun., vol. 32, pp. 797-815, November 1986.
17. K. A. S. Immink, Coding techniques for the noisy magnetic recording channel: A state-of-the-art report, IEEE Trans. Commun., vol. 35, pp. 413-419, May 1987.
18. R. Karabed and P. H. Siegel, Matched spectral-null codes for partial response channels, IEEE Trans. Inform. Theory, vol. 37, pp. 818-855, May 1991.
19. R. G. Gallager, Low-Density Parity-Check Codes, MIT Press, Cambridge, MA, 1962.
20. D. J. C. MacKay and R. M. Neal, Near Shannon limit performance of low-density parity-check codes, Electron. Lett., vol. 32, pp. 1645-1646, 1996.
21. 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.
22. W. Ryan, Performance of high-rate turbo codes on PR4-equalized magnetic recording channels, in Proceedings of IEEE International Conference on Communications, Atlanta, GA, pp. 947-951, June 1998.
23. M. C. Reed and C. B. Schlegel, An iterative receiver for partial response channels, in Proceedings IEEE International Symposiums Information Theory, Cambridge, MA, p. 63, August 1998.
24. T. Souvignier, A. Friedmann, M. O¨ berg, P. Siegel, R. E. Swanson, and J. K. Wolf, Turbo codes for PR4: Parallel versus serial concatenation, in Proceedings of IEEE International Conference on Comm., pp. 1638-1642, June 1999.
25. L. L. McPheters, S. W. McLaughlin, and K. R. Narayanan, Precoded PRML, serial concatenation, and iterative (turbo) decoding for digitalmagnetic recording, IEEETrans. Magn., vol. 35, September 1999.
26. M. Tüchler, R. Kötter, and A. Singer, Iterative correction of ISI via equalization and decoding with priors, in Proceedings of IEEE International Symposiums Information Theory, Sorrento, Italy, p. 100, June 2000.
27. J. Park and J. Moon, A new soft-output detection method for magnetic recording channels, in Proceedings IEEE Global Communications Conference 2001, San Antonio, Texas, pp. 3002-3006, November 2001.
28. J. Fan, A. Friedmann, E. Kurtas, and S. McLaughlin, Low density parity check codes for magnetic recording, in Proceedings Allerton Conference on Communications and Control, 1999.
29. M. Oberg and P. H. Siegel, Parity check codes for partial response channels, in Proceedings IEEE Global Telecommunications Conference, vol. 1, Rio de Janeiro, pp. 717-722, December 1999.
30. J. Li, K. R. Narayanan, E. Kurtas, and C. N. Georghiades, On the performance of high rate turbo product codes and low density parity check codes for partial response channels, IEEE Trans. Commun., vol. 50, pp. 723-734, May 2002.
31. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman, Improved low-density parity-check codes using irregular graphs, IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, February 2001.
32. T. Richardsonand R. Urbanke, Thecapacityof low-density parity check codes under message-passing decoding, IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, February 2001.
33. T. Richardson, A. Shokrollahi, and R. Urbanke, Design of capacity-approaching low-density paritycheck codes, IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, February 2001.
34. S. -Y. Chung, G. D. Forney, T. Richardson, and R. Urbanke, On the design of low-density parity-check codes within 0. 0045 dB of the Shannon limit, IEEE Commun. Lett., February 2001.
35. A. Kavčić, X. Ma, and M. Mitzenmacher, Binary intersymbol interference channels: Gallager codes, density evolution and code performance bounds, IEEE Trans. Inform. Theory, pp. 1636-1652, July 2003.
36. N. Varnica and A. Kavčić, Optimized low-density parity-check codes for partial response channels, IEEE Commun. Lett., vol. 7, pp. 168-170, April 2003.
37. A. Kavčić and A. Patapoutian, Asignal-dependent autoregressive channel model, IEEE Trans. Magn., vol. 35, pp. 2316-2318, September 1999.
38. E. Kurtas, J. Park, X. Yang, W. Radich, and A. Kavčić, Detection methods for data-dependent noise in storage channels, Chapter 33.
39. R. G. Gallager, Information Theory and Reliable Communication, John Wiley and Sons, New York, 1968.
40. T. M. Cover and J. A. Thomas, Elements of Information Theory, JohnWiley and Sons, New York, 1991.
41. A. Kavčić, X. Ma, and N. Varnica, Matched information rate codes for partial response channels, submitted for publication in IEEE Trans. Inform. Theory, July 2002.
42. Y. -C. Ho, An explanation of ordinal optimization: Soft computing for hard problems, Inform. Sci., vol. 113, pp. 169-192, February 1999.
43. G. D. Forney Jr., Codes on graphs: Normal realizations, IEEE Trans. Inform. Theory, vol. 47, pp. 520-548, February 2001.
44. H. Imai and S. Hirakawa, A new multilevel coding method using error correcting codes, IEEE Trans. Inform. Theory, vol. 23, pp. 371-377, May 1977.