Eliminating trapping sets in low-density parity-check codes by using tanner graph covers

IEEE Transactions on Information Theory

Volumn 54, Issue 8, 2008, Pages 3763-3768

  Ivković, Miloš ^a   Chilappagari, Shashi Kiran ^b   Vasić, Bane ^b  

^a University of Arizona   (United States)

^b University of Arizona   (United States)

Author keywords

Convolutional low density parity codes (LDPC) codes; Error floor; Gallager B; Low density parity codes (LDPC) codes; Min sum decoding algorithm; Tanner code; Trapping sets

Indexed keywords

BLOCK CODES; CODES (STANDARDS); DECODING; FLOORS; GRAPH THEORY; SET THEORY; TRANSCEIVERS;

AWGN CHANNELS; BINARY SYMMETRIC CHANNEL; CODE LENGTHS; CODE RATES; CONVOLUTIONAL LOW-DENSITY PARITY-CODES (LDPC) CODES; DECODING ALGORITHMS; ERROR FLOOR; GALLAGER B; HIGH SNR; LDPC CODING; LOW-DENSITY PARITY CODES (LDPC) CODES; LOW-DENSITY PARITY-CHECK CODES; MIN-SUM DECODING ALGORITHM; PERFORMANCE IMPROVEMENTS; TANNER CODE; TANNER GRAPH; TRAPPING SETS;

CODES (SYMBOLS);

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

References (26)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
3. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, pp. 619-637, 2001.
4. D. MacKay and M. Postol, "Weaknesses of margulis and ramanujanmargulis low-density parity check codes," Electron. Notes Theoret. Comput. Sci., vol. 74, 2003.
5. N. Wiberg, "Codes and Decoding on General Graphs," Ph.D. dissertation, Linköping University, Linköping, Sweden, 1996.
6. J. K. Moura, J. Lu, and H. Zhang, "Structured LDPC codes with large girth," IEEE Signal Proc. Mag., vol. 21, no. 1, pp. 42-55, Jan. 2004.
7. C. Di et al., "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
8. C. Wang, S. R. Kulkarni, and H. V. Poor, "Upper bounding the performance of arbitrary finite ldpc codes on binary erasure channels," in Proc. Int. Symp. Inf. Theory, Seattle, WA, USA, Jul. 9-14, 2006.
9. T. J. Richardson, "Error floors of LDPC codes," in Proc. 41st Annu. Allerton Conf. Commun., Contr. Comput., 2003.
10. M. Stepanov and M. Chertkov, "Instanton analysis of low-density parity-check codes in the error-floor regime," in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Seattle, WA, Jul. 9-14, 2006.
11. Z. Zhang, L. Dolecek, B. Nikoli,́ V. Anantharam, and M. Wainwright, "Investigation of Error Floors of Structured Low- Density Parity-Check Codes by Hardware Emulation," presented at the Proc. IEEE GLOBECOM, San Francisco, CA, 2006.
12. P. O. Vontobel and R. Koetter, Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of Ldpc Codes [Online]. Available: http://www.arxiv.org/
13. R. Smarandache and P. O. Vontobel, Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes [Online]. Available: http:// arxiv.org/
14. R. Smarandache, A. E. Pusane, P. O. Vontobel, D. J. Costello, and Jr., Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes [Online]. Available: http://arxiv.org/
15. A. E. Pusane, R. Smarandache, P. O. Vontobel, and D. J. Costello Jr., "On deriving good LDPC convolutional codes from OC LDPC Block Codes," in Proc. IEEE Int. Symp. Inf. Theory, Nice, France, Jun. 24-29, 2007, pp. 1221-1225.
16. 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, B. Marcus and J. Rosenthal, Eds. New York: Springer Verlag, 2001, pp. 101-112.
17. S. K. Chilappagari, S. Sankaranarayanan, and B. Vasic, "Error Floors of LDPC Codes on the Binary Symmetric Channel," presented at the Proc. Int. Conf. Commun., ICC 2006, Istanbul, Turkey, Jun. 2006.
18. N. Varnica and M. Fossorier, "Improvements in belief-propagation decoding based on averaging information from decoder and correction of clusters of nodes," IEEE Communications Letters, vol. 10, no. 12, pp. 846-848, Dec. 2006.
19. S. Laendner, T. Hehn, O. Milenković, and J. Huber, "When does one redundant parity-check equation matter?," presented at the Proc. IEEE GLOBECOM, San Francisco, CA, 2006.
20. C. Wang, "Code annealing and the suppressing effect of the cyclically lifted LDPC code ensemble," presented at the 2006 IEEE Information Theory Workshop, Chengdu, China, Oct. 22-26, 2006, unpublished.
21. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of Group-Structured LDPC codes," Proc. ISCTA, 2001.
22. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using ramanujan graphs and ideas from margulis," in Proc. 38th Allerton Conf. Commun., Contr. Comput., 2000.
23. D. J. C. MacKay, Encyclopedia of Sparse Graph Codes [Online].Available: http://www.interference.phy.cam.ac.uk/mackay/codes/data.html
24. J. Thorpe, Low Density Parity Check (LDPC) Codes Constructed from Protographs JPL INP Progress, Pasadena, CA, Rep. 42-154, Aug. 15, 2003.
25. D. Divsalar and C. Jones, "Protgraph LDPC Codes with Node Degrees at Least 3," presented at the Proc. IEEE GLOBECOM, San Francisco, CA, 2006.
26. C. Kelley, D. Sridhara, and J. Rosenthal, Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [Online]. Available: http://arxiv.org/