Determining and approaching achievable rates of binary intersymbol interference channels using multistage decoding

IEEE Transactions on Information Theory

Volumn 53, Issue 4, 2007, Pages 1416-1429

  Soriaga, Joseph B ^a,b   Pfister, Henry D ^c   Siegel, Paul H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b QUALCOMM INC   (United States)

^c Texas AandM University   (United States)

Author keywords

Bahl Cocke Jelinek Raviv (BCJR) algorithm; Coset codes; Density evolution; Finite state channels; Information rates; Intersymbol interference (ISI) channels; Low density parity check (LDPC) codes; Magnetic recording; Multilevel coding; Multistage decoding

Indexed keywords

DECODING; INTERSYMBOL INTERFERENCE; MAGNETIC RECORDING; SIGNAL ENCODING;

FINITE-STATE CHANNELS; INFORMATION RATE; INTERSYMBOL INTERFERENCE CHANNELS; LOW-DENSITY PARITY-CHECK CODES; MULTILEVEL CODING SCHEME; MULTISTAGE DECODING;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (57)

1. K. A. S. Immink, P. H. Siegel, and J. K. Wolf, "Codes for digital recorders," IEEE Trans. Inf. Theory, vol. 44, no. 6, pp. 2260-2299, Oct. 1998.
2. D. Arnold and H. Loeliger, "On the information rate of binary-input channels with memory," in Proc. IEEE Int. Conf. Communications, Helsinki, Finland, Jun. 2001, pp. 2692-2695.
3. H. D. Pfister, J. B. Soriaga, and P. H. Siegel, "On the achievable information rates of finite state ISI channels," in Proc. IEEE Global Telecommunications Conf., San Antonio, TX, Nov. 2001, pp. 2992-2996.
4. V. Sharma and S. K. Singh, "Entropy and channel capacity in the regenerative setup with applications to Markov channels," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 283.
5. D. M. Arnold, H.-A. Loeliger, P. O. Vontobel, A. Kavčić, and W. Zeng, "Simulation-based computation of information rates for channels with memory," IEEE Trans. Inf. Theory, vol. 52, no. 8, pp. 3498-3508, Aug. 2006.
6. C. Douillard, M. Jézéquel, C. Berrou, A. Picart, P. Didier, and A. Glavieux, "Iterative correction of intersymbol interference: Turbo equalization," Europ. Trans. Telecommun. Related Technol., vol. 6, pp. 507-511, Sept.-Oct. 1995.
7. 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.
8. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
9. T. M. Cover and J. A.Tbomas, Elements of Information Theory. New York: Wiley, 1991.
10. A. R. Barron, "The strong ergodic theorem for densities: Generalized Shannon- McMillan-Breiman theorem," Ann. Probab., vol. 13, pp. 1292-1303, Nov. 1985.
11. W. Hirt, "Capacity and information rates of discrete-time channels with memory," Ph.D. dissertation, Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 1988.
12. 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. Inf. Theory, vol. 37, no. 6, pp. 1527-1539, Nov. 1991.
13. 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. 2, pp. 284-287, Mar. 1974.
14. A. Kavčić, "On the capacity of Markov sources over noisy channels," in Proc. IEEE Global Telecommunications Conf., San Antonio, TX, Nov. 2001, pp. 2997-3001.
15. P. O. 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.
16. S. Yang, A. Kavčić, and S. Tatikonda, "Delayed feedback capacity of finite-state machine channels: Upper bounds on the feedforward capacity," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 290.
17. R. G. Gallager, Information Theory and Reliable Communication. New York: Wiley, 1968.
18. W. E. Ryan, L. L. McPheters, and S. W. McLaughlin, "Combined turbo coding and turbo equalization for PR4-equalized Lorentzian channels," in Proc. Conf. Information Sciences and Systems, Princeton, NJ, Mar. 1998, pp. 489-493.
19. T. Souvignier, M. Öberg, P. H. Siegel, R. E. Swanson, and J. K. Wolf, "Turbo decoding for partial response channels," IEEE Trans. Commun. vol. 48, no. 8, pp. 1297-1308, Aug. 2000.
20. M. Öberg and P. H. Siegel, "Performance analysis of turbo-equalized dicode partial-response channel," IEEE Trans. Commun., vol. 49, no. 3, pp. 436-444, Mar. 2001.
21. J. L. Fan, A. Friedmann, E. Kurtas, and S. W. McLaughlin, "Low density parity check codes for magnetic recording,:in Proc. 37th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Sep. 1999, pp. 1314-1323.
22. M. Tüchler, C. Weiß, E. Eleftheriou, A. Dholakia, and J. Hagenauer, "Application of high-rate tail-biting codes to generalized partial response channels," in Proc. IEEE Global Telecommunications Conf. San Antonio, TX, Nov. 2001, vol. 5, pp. 2966-2971.
23. K. Narayanan, "Effect of precoding on the convergence of turbo equalization for partial response channels," IEEE J. Sel. Areas Commun., vol. 19, no. 4, pp. 686-698, Apr. 2001.
24. D. Doan and K. R. Narayanan, "Some new results on the design of codes for inter-symbol interference channels based on convergence of turbo equalization," in Proc. IEEE Int. Conf. Communications, New York, Apr. 2002, pp. 1873-1877.
25. A. Thangaraj and S. W. McLaughlin, "Thresholds and scheduling for LDPC-coded partial-response channels," IEEE Trans. Magn., vol. 38, no. 5, pp. 2307-2309, Sep. 2002.
26. S. ten Brink, "Designing iterative decoding schemes with the extrinsic information transfer chart," in AEU Int. J. Electron. and Commun. Nov. 2000, vol. 54, pp. 389-398.
27. 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.
28. N. Varnica and A. Kavčić, "Optimized LDPC codes for partial response channels," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun. 2002, p. 197.
29. 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.
30. T. J. Richardson and R. L. 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.
31. B. F. Filho, M. A. Herro, and D. J. Costello, Jr., "A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2582-2591, Nov. 1999.
32. A. V. Kuznetsov, "Coded modulation schemes with turbo and list detection for high-order partial response channels," IEEE Trans. Magn., vol. 37, no. 2, pp. 729-736, Mar. 2001.
33. J. A. Miller and J. K. Wolf, "High code rate ECC design for partial response systems," IEEE Trans. Magn., vol. 37, no. 2, pp. 704-707, Mar. 2001.
34. X. Ma, N. Varnica, and A. Kavčić, "Matched information rate codes for binary ISI channels," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, Jun./Jul. 2002, p. 269.
35. J. B. Soriaga, H. D. Pfister, and P. H. Siegel, "On approaching the capacity of finite-state intersymbol interference channels," in Information, Coding, and Mathematics: Proc. Workshop Honoring Prof. Bob McEliece on His 60th Birthday, M. Blaum, P. G. Farrell, and H. C. A. van Tilborg, Eds. Boston, MA: Kluwer Academic, 2002, pp. 365-378.
36. K. R. Narayanan and N. Nangare, "A BCJR-DFE based receiver for achieving near capacity performance on ISI channels," in Proc. 42nd Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2004, pp. 763-772.
37. T. Li and O. M. Collins, "A successive decoding strategy for channels with memory," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sep. 2005, pp. 239-243.
38. T. Li and O. M. Collins, "A successive decoding strategy for channel with memory," IEEE Trans. Inf. Theory, vol. 53, no. 2, pp. 628-646, Feb. 2007.
39. U. Wachsmann, R. F. H. Fischer, and J. B. Huber, "Multilevel codes: Theoretical concepts and practical design rules," IEEE Trans. Inf. Theory, vol. 45, no. 5, pp. 1361-1391, Jul. 1999.
40. J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, "Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes," IEEE Trans. Inf. Theory vol. 49, no. 9, pp. 2141-2155, Sep. 2003.
41. B. M. Kurkoski, P. H. Siegel, and J. K. Wolf, "Joint message-passing decoding of LDPC codes and partial-response channels," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1410-1422, Jun. 2002.
42. F. Le Gland and L. Mevel, "Exponential forgetting and geometric ergodicity in hidden Markov models," Math. Control Signals Syst., vol. 13, pp. 63-93, Jul. 2000.
43. F. Le Gland and L. Mevel, "Basic properties of the projective product with application to products of column-allowable nonnegative matrices," Math. Control Signals Syst., vol. 13, pp. 41-62, Jul. 2000.
44. Y. Ephraim and N. Merhav, "Hidden Markov processes," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1518-1569, Jun. 2002.
45. J. B. Soriaga, "On near-capacity code design for partial-response channels," Ph.D. dissertation, Univ. Calif., San Diego, La Jolla, Mar. 2005.
46. R. M. Gray, Probability, Random Processes, and Ergodic Properties. New York: Springer-Verlag, 1988.
47. A. Kavčić, X. Ma, and N. Varnica, "Matched information rate codes for partial response channels," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 973-989, Mar. 2005.
48. S.-Y. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, MIT, Cambridge, MA, 2001.
49. J. Hou, P. H. Siegel, L. B. Milstein, and H. D. Pfister, "Multilevel coding with low-density parity-check component codes," in Proc. IEEE Global Telecommunications Conf., San Antonio, TX, Nov. 2001, pp. 1016-1020.
50. R. L. Urbanke and T. J. Richardson, Modern Coding Theory, 2003 [Online]. Available: http://lthcwww.epfl.ch/mct, Cambridge Univ. Press, preprint.
51. S. Chung, G. D. Forney, Jr., T. J. Richardson, and R. L. 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.
52. J. B. Soriaga, M. Marrow, P. H. Siegel, and J. K. Wolf, "On achievable rates of multistage decoding on two-dimensional ISI channels," in Proc. IEEE Int. Symp. Information Theory, Adelaide, Australia, Sept. 2005, pp. 1348-1352.
53. J. Chen and P. Siegel, "On the symmetric information rate of two-dimensional finite state ISI channels," in Proc. IEEE Information Theory Workshop, Paris, France, Mar. 2003, pp. 320-323.
54. J. B. Soriaga and P. H. Siegel, "Near-capacity coding systems for partial-response channels," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, June 2004, p. 267.
55. J. B. Soriagaand P. H. Siegel, "On distribution shaping codes for partial-response channels," in Proc. 41st Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2003, pp. 468-477.
56. A. Ganti, A. Lapidoth, and I. E. Telatar, "Mismatched decoding revisited: General alphabets, channels with memory, and the wide-band limit," IEEE Trans. Inf. Theory, vol. 46, no. 7, pp. 2315-2328, Nov. 2000.
57. J. G. Proakis, Digital Communications, 3rd ed. New York: McGraw-Hill, 1995.