On designing good LDPC codes for Markov channels

IEEE Transactions on Information Theory

Volumn 53, Issue 1, 2007, Pages 5-21

  Eckford, Andrew W ^a,b   Kschischang, Frank R ^a   Pasupathy, Subbarayan ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b YORK UNIVERSITY   (Canada)

Author keywords

Code optimization; Density evolution; Estimation decoding; Gaussian assumption; Irregular low density parity check (LDPC) codes; Markov channels; Message passing schedules

Indexed keywords

APPROXIMATION THEORY; CODES (SYMBOLS); DECODING; ESTIMATION; ITERATIVE METHODS; MARKOV PROCESSES; OPTIMIZATION;

CODE OPTIMIZATION; DENSITY EVOLUTION; GAUSSIAN ASSUMPTION; GILBERT-ELLIOT CHANNEL; HIDDEN MARKOV CHAIN; LOW-DENSITY PARITY-CHECK (LDPC); MARKOV CHANNELS; MESSAGE-PASSING SCHEDULES;

COMMUNICATION CHANNELS (INFORMATION THEORY);

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

References (19)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
3. 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.
4. 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.
5. H. Jin and T. J. Richardson, "A new fast density evolution," in Proc. IEEE Information Theory Workshop, Punta del Este, Uruguay, Mar. 2006, pp. 183-187.
6. S. ten Brink, "Convergence of iterative decoding," Electron. Lett., vol. 35, pp. 806-808, May 1999.
7. M. Ardakani and F. R. Kschischang, "A more accurate one-dimensional analysis and design of LDPC codes," IEEE Trans. Commun., vol. 52, no. 12, pp. 2106-2114, Dec. 2004.
8. A. W. Eckford, F. R. Kschischang, and S. Pasupathy, "Analysis of low-density parity-check codes for the Gilbert-Elliott channel," IEEE Trans. Inf. Theory, vol. 51, no. 11, pp. 3872-3889, Nov. 2005.
9. S. ten Brink, G. Kramer, and A. Ashikhmin, "Design of low-density parity-check codes for modulation and detection," IEEE Trans. Commun., vol. 52, no. 4, pp. 670-678, Apr. 2004.
10. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
11. A. P. Worthen and W. E. Stark, "Unified design of iterative receivers using factor graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 843-849, Feb. 2001.
12. 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.
13. 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.
14. J. Garcia-Frias, "Decoding of low-density parity-check codes over finite-state binary Markov channels," IEEE Trans. Commun., vol. 52, no. 11, pp. 1840-1843, Nov. 2004.
15. S.-Y. Chung, T. J. Richardson, and R. L. Urbanke, "Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 657-670, Feb. 2001.
16. J. Garcia-Frias and J. D. Villasenor, "Turbo decoding of Gilbert-Elliott channels," IEEE Trans. Commun., vol. 50, no. 3, pp. 357-363, Mar. 2002.
17. T. J. Richardson and R. L. Urbanke, "Thresholds for turbo codes," in Proc. IEEE Int. Symp. Information Theory, Sorrento, Italy, Jun./Jul. 2000, p. 317.
18. 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.
19. S. P. Meyn, Markov Chains and Stochastic Stability. London, U.K.: Springer-Verlag, 1993.