Pseudocodeword performance analysis for LDPC convolutional codes

IEEE Transactions on Information Theory

Volumn 55, Issue 6, 2009, Pages 2577-2598

  Smarandache, Roxana ^a   Pusane, Ali E ^b   Vontobel, Pascal O ^c   Costello, Daniel J ^c  

^a SAN DIEGO STATE UNIVERSITY   (United States)

^b University of Notre Dame   (United States)

^c HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Convolutional codes; Linear programming decoding; Low density parity check (LDPC) codes; Message passing iterative decoding; Pseudocodewords; Pseudoweights; Quasi cyclic codes

Indexed keywords

LINEAR PROGRAMMING DECODING; LOW-DENSITY PARITY-CHECK (LDPC) CODES; MESSAGE-PASSING ITERATIVE DECODING; PSEUDOCODEWORDS; PSEUDOWEIGHTS; QUASI-CYCLIC CODES;

ACOUSTIC INTENSITY; BLOCK CODES; COMMUNICATION CHANNELS (INFORMATION THEORY); CONVOLUTION; CONVOLUTIONAL CODES; DATA COMMUNICATION SYSTEMS; DYNAMIC PROGRAMMING; LINEARIZATION; MAXIMUM LIKELIHOOD ESTIMATION; MESSAGE PASSING; SIGNAL TO NOISE RATIO;

ITERATIVE DECODING;

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

References (30)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21-28, Jan. 1962.
2. 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.
3. 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.
4. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
5. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Linköping Univ., Linköping, Sweden, 1996.
6. R. Koetter and P. O. Vontobel, "Graph covers and iterative decoding of finite-length codes," in Proc. 3rd Int. Symp. on Turbo Codes and Related Topics, Brest, France, Sep. 2003, pp. 75-82.
7. P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," IEEE Trans. Inf. Theory, 2007, accepted for publication.
8. W. S. Massey, Algebraic Topology: An Introduction, reprint of the 1967 ed. New York: Springer-Verlag, 1977, vol. 56, Graduate Texts in Mathematics.
9. H. M. Stark and A. A. Terras, "Zeta functions of finite graphs and coverings," Adv. Math., vol. 121, no. 1, pp. 124-165, 1996.
10. R. Smarandache and P. O. Vontobel, "Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes," IEEE Trans. Inform. Theory, vol. 53, no. 7, pp. 2376-2393, Jul. 2007.
11. G. D. Forney, Jr., R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Codes, Systems, and Graphical Models (Minneapolis, MN, 1999), B. Marcus and J. Rosenthal, Eds. New York: Springer-Verlag, 2001, vol. 123, IMA Math. Appl, pp. 101-112.
12. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 2966-2984, Dec. 2004.
13. R. Smarandache and P. O. Vontobel, "On regular quasi-cyclic LDPC codes from binomials," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 274.
14. R. M. Tanner, "Convolutional Codes From Quasi-Cyclic Codes: A Link Between the Theories of Block and Convolutional Codes," UC Santa Cruz, Santa Cruz, CA, 1987, Tech Rep. UCSC-CRL-87-21.
15. Y. Levy and D. J. Costello, Jr., "An algebraic approach to constructing convolutional codes from quasi-cyclic codes," in Coding and Quantization (Piscataway, NJ, 1992). Providence, RI: Amer. Math. Soc., 1993, vol. 14, DIMACS Ser. Discrete Math. Theoret. Comput. Sci, pp. 189-198.
16. M. Esmaeili, T. A. Gulliver, N. P. Secord, and S. A. Mahmoud, "A link between quasi-cyclic codes and convolutional codes," IEEE Trans. Inf. Theory, vol. 44, no. 1, pp. 431-435, Jan. 1998.
17. J. Feldman, "Decoding Error-Correcting Codes via Linear Programming," Ph.D. dissertation, MIT, Cambridge, MA, 2003.
18. J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inf. Theory vol. 51, no. 3, pp. 954-972, Mar. 2005.
19. P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. Int. Symp. Information Theory and its Applications (ISITA), Parma, Italy, Oct. 2004, pp. 991-996.
20. R. Smarandache, A. E. Pusane, P. O. Vontobel, and D. J. Costello, Jr., "Pseudo-codewords in LDPC convolutional codes," in Proc. IEEE Int. Symp. Information Theory, Seattle, WA, Jul. 2006, pp. 1364-1368.
21. M. Chertkov and M. G. Stepanov, "An efficient pseudocodeword search algorithm for linear programming decoding of LDPC codes," IEEE Trans. Inf. Theory, vol. 54, no. 4, pp. 1514-1520, Apr. 2008.
22. A. Sridharan and D. J. Costello, Jr., "A new construction for low density parity check convolutional codes," in Proc. IEEE Information Theory Workshop, Bangalore, India, Oct. 2002, p. 212.
23. A. E. Pusane, R. Smarandache, P. O. Vontobel, and D. J. Costello, Jr., "On deriving good LDPC convolutional codes from QC LDPC block codes," in Proc. IEEE Int. Symp. Information Theory, Nice, France, Jun. 2007, pp. 1221-1225.
24. A. Jiménez-Felström and K. S. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2181-2191, Sep. 1999.
25. D. Avis, "LRS: A revised implementation of the reverse search vertex enumeration algorithm," in Polytopes - Combinatorics and Computation G. Kalai and G. M. Ziegler, Eds. Basel, Switzerland: Birkhäuser-Verlag, 2000, pp. 177-198.
26. J. Feldman, T. Malkin, R. A. Servedio, C. Stein, and M. J. Wainwright, "LP decoding corrects a constant fraction of errors," IEEE Trans. Inf. Theory, vol. 53, no. 1, pp. 82-89, Jan. 2007.
27. P. O. Vontobel and R. Koetter, "Lower bounds on the minimum pseudo-weight of linear codes," in Proc. IEEE Int. Symp. Information Theory, Chicago, IL, Jun./Jul. 2004, p. 70.
28. S. Lin and D. J. Costello, Jr., Error Control Coding, 2nd ed. Upper Saddle River, NJ: Prentice-Hall, 2004.
29. I. E. Bocharova, M. Handlery, R. Johannesson, and B. D. Kudryashov, "A BEAST for prowling in trees," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1295-1302, Jun. 2004.
30. A. Marshall and I. Olkin, Inequalities: Theory of Majorization and Its Applications. San Diego, CA: Academic, 1979.