Matched information rate codes for partial response channels

IEEE Transactions on Information Theory

Volumn 51, Issue 3, 2005, Pages 973-989

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

^a HARVARD UNIVERSITY   (United States)

^b SUN YAT SEN UNIVERSITY   (China)

Author keywords

Channel capacity; Concatenated codes; Density evolution; Low density parity check (LDPC) codes; Markov capacity; Markov processes; Partial response channel; Superchannel; Trellis code

Indexed keywords

CHANNEL CAPACITY; DECODING; ENCODING (SYMBOLS); MARKOV PROCESSES; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBABILITY; SPURIOUS SIGNAL NOISE; TRELLIS CODES;

CONCATENATED CODES; DENSITY EVOLUTION; LOW DENSITY PARITY CHECK (LDPC) CODES; MARKOV CAPACITY; PARTIAL RESPONSE CHANNEL; SUPERCHANNEL;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (46)

1. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
2. T. M. Cover and J. A. Thomas, Elements of Information Theory. New York: Wiley, 1991.
3. A. J. Goldsmith and P. P. Varaiya, "Capacity, mutual information and coding for finite state Markov channels," IEEE Trans. Inf. Theory vol. 42, no. 3, pp. 868-886, May 1996.
4. V. Sharma and S. K. Singh, "Maximum likelihood sequence estimation in channels with intersymbol interference and noise memory," in Proc. IEEE Int. Symp. Information Theory, Cambrdge, MA, Aug. 1998, p. 366.
5. D. Arnold and H.-A. Loeliger, "On the information rate of binary-input channels with memory," in Proc. IEEE Int. Conf. Communications 2001 Helsinki, Finland, Jun. 2001, pp. 2692-2695.
6. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rates of finite state ISI channels," in Proc. IEEE Global Communications Conf. 2001, San Antonio, TX, Nov. 2001, pp. 2992-2996.
7. A. Kavčić, "On the capacity of Markov sources over noisy channels," in Proc. IEEE Global Communications Conf. 2001, San Antonio, TX, Nov. 2001, pp. 2997-3001.
8. P. Vontobel and D. M. Arnold, "An upper bound on the capacity of channels with memory and constraint input," in Proc. IEEE Information Theory Workshop, Cairns, Australia, Sep. 2001, pp. 147-149.
9. S. Yang and A. Kavčić, "Markov sources achieve the feedback capacity of finite-state machine channels," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 361.
10. S. C. Tatikonda, "Control under communications constraints," Ph.D. dissertation, MIT, Cambridge, MA, 2000.
11. S. Yang and A. Kavčić, "Capacity of partial response channels," in Coding and Signal Processing for Magnetic Recording Systems, B. Vasic and M. E. Kurtas, Eds. Boca Raton, FL: CRC, 2004, ch. 13, pp. 13.1-13.19.
12. G. D. Forney Jr., "Maximum-likelihood sequence estimation of digital sequences in the presence of intersymbol interference," IEEE Trans. Inf. Theory, vol. IT-18, no. 2, pp. 363-378, Mar. 1972.
13. H. Kobayashi, "Application of probabilistic decoding to magnetic recording systems," IBM J. Res. Devel., vol. 16, pp. 64-74, Jan. 1971.
14. R. W. Chang and J. C. Hancock, "On receiver structures for channels having memory," IEEE Trans. Inf. Theory, vol. IT-12, no. 4, pp. 463-468, Oct. 1966.
15. L. E. Baum and T. Petrie, "Statistical inference for probabilistic functions of finite state Markov chains," Ann. Math. Statist., vol. 37, pp. 1559-1563, 1966.
16. P. L. McAdam, L. R. Welch, and C. L. Weber, "M.A.P. bit decoding of convolutional codes," in IEEE Int. Symp. Information Theory, Asilomar, CA, 1972, p. 91.
17. L. Rabiner and B.-H. Juang, Fundamentals of Speech Recognition. Englewood Cliffs, NJ: Prentice-Hall, 1993.
18. 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. 5, pp. 284-287, Sep. 1974.
19. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Europ. Trans. Commun., vol. 6, pp. 513-526, Sep. 1995.
20. Y. Li, B. Vucetic, and Y. Sato, "Optimum soft-output detection for channels with intersymbol interference," IEEE Trans. Inf. Theory, vol. 41, no. 3, pp. 704-713, May 1995.
21. S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inf. Theory, vol. 46, no. 2, pp. 325-343, Mar. 2000.
22. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
23. X. Ma and A. Kavčić, "Path partitions and forward-only trellis algorithms," IEEE Trans. Inf. Theory, vol. 49, no. 1, pp. 38-52, Jan. 2003.
24. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: Turbo-codes," in Proc. IEEE Int. Conf. Communications, Geneva, Switzerland, May 1993, pp. 1064-1070.
25. G. Ungerboeck, "Channel coding with multilevel/phase signals," IEEE Trans. Inf. Theory, vol. IT-28, no. 1, pp. 55-67, Jan. 1982.
26. J. K. Wolf and G. Ungerboeck, "Trellis coding for partial-response channels," IEEE Trans. Commun., vol. COM-34, no. 3, pp. 744-765, Mar. 1986.
27. A. R. Calderbank, C. Heegard, and T. A. Lee, "Binary convolutional codes with application to magnetic recording," IEEE Trans. Inf. Theory, vol. IT-32, no. 6, pp. 797-815, Nov. 1986.
28. K. A. S. Immink, "Coding techniques for the noisy magnetic recording channel: A state-of-the-art report," IEEE Trans. Commun., vol. COM-35, no. 5, pp. 413-419, May 1987.
29. R. Karabed and P. H. Siegel, "Matched spectral-null codes for partial response channels," IEEE Trans. Inf. Theory, vol. 37, no. 3, pp. 818-855, May 1991.
30. J. Douillard, M. Jezequel, C. Berrou, A. Picart, P. Didier, and A. Glavieux, "Iterative correction of intersymbol interference: Turbo-equalization," Eorop. Trans. Commun., vol. 6, pp. 507-511, Sep. 1995.
31. 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.
32. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1962.
33. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
34. T. Richardson and R. Urbanke, "The capacity of low-density parity check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
35. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001
36. 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., vol. 5, no. 2, pp. 58-60, Feb. 2001.
37. A. Kavčić, X. Ma, and M. Mitzenmacher, "Binary intersymbol interference channels: Gallager codes, density evolution, and code performance bounds," IEEE Trans. Inf. Theory, vol. 49, no. 7, pp. 1636-1652, Jul. 2003.
38. N. Varnica and A. Kavčić, "Optimized low-density parity-check codes for partial response channels," IEEE Commun. Lett., vol. 7, no. 4, pp. 168-170, Apr. 2003.
39. 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.
40. A. Vardy, "Trellis structure of codes," in Handbook of Coding Theory, V. S. Pless, W. C. Huffman, and R. A. Brualdi, Eds. Amsterdam, The Netherlands: Elsevier, 1998.
41. G. D. Forney Jr., Concatenated Codes. Cambridge, MA: MIT Press. 1966.
42. Y.-C. Ho, "An explanation of ordinal optimization: Soft computing for hard problems," Inf. Sci., vol. 113, pp. 169-192, Feb. 1999.
43. G. D. Forney Jr., "Codes on graphs: Normal realizations," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.
44. H. Imai and S. Hirakawa, "A new multilevel coding method using error correcting codes," IEEE Trans. Inf. Theory, vol. IT-23, no. 3, pp. 371-377, May 1977.
45. B. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
46. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.