On girth conditioning for low-density parity-check codes

IEEE Transactions on Communications

Volumn 59, Issue 2, 2011, Pages 357-362

  Bandi, Samuele ^a   Tralli, Velio ^a   Conti, Andrea ^a   Nonato, Maddalena ^a  

^a UNIVERSITY OF FERRARA   (Italy)

Author keywords

breadth first search algorithm; girth conditioning; Low density parity check codes; performance evaluation

Indexed keywords

BIPARTITE GRAPHS; BREADTH FIRST SEARCH ALGORITHMS; COMPLEXITY REDUCTION; GIRTH CONDITIONING; HIGH DATA RATE APPLICATIONS; LDPC CODES; LOW-COMPLEXITY; LOW-DENSITY PARITY-CHECK CODES; PERFORMANCE EVALUATION; PERFORMANCE IMPROVEMENTS; SIMULATION RESULT;

CODES (SYMBOLS); CODING ERRORS; ERROR CORRECTION; LEARNING ALGORITHMS; SATELLITE COMMUNICATION SYSTEMS; SIGNAL ENCODING; STRUCTURAL OPTIMIZATION;

GRAPH THEORY;

EID: 79951854196     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2011.121410.090017     Document Type: Article

References (23)

1. R. G. Gallager, Low-Density Parity-Check Codes. MIT Press 1963.
2. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001. (Pubitemid 32318094)
3. M. Kay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Feb. 1999.
4. G. P. Calzolari, M. Chiani, F. Chiaraluce, R. Garello, and E. Paolini, "Channel coding for future space missions: new requirements and trends," Proc. IEEE, vol. 95, no. 11, pp. 2157-2170, Nov. 2007.
5. A. Conti, D. Panchenko, S. Sidenko, and V. Tralli, "Local bounds based on log-concavity property of the error probability in wireless communication systems," IEEE Trans. Inf. Theory, vol. 55, no. 6, pp. 2766-2775, June 2009.
6. G. Liva, E. Paolini, and M. Chiani, "Quasi-cyclic generalized LDPC codes with low error floor," IEEE Trans. Commun., vol. 56, no. 1, pp. 49-57, Jan. 2008. (Pubitemid 351292074)
7. M. Yang, Y. Li, and W. E. Ryan, "Design of efficiently encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun., vol. 52, no. 4, pp. 564-571, Apr. 2004.
8. T. Richardson and R. Urbanke, "The capacity of low-density paritycheck codes under message passing decodiong," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-619, Feb. 2001.
9. Y. Mao and A. H. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. IEEE ICC 2001, June 2001, Helsinki, Finland, pp. 41-44.
10. J. Rosenthal and P. O. Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. IEEE ISIT 2001, June 2001, Washington DC, p. 4.
11. D. Leyba, O. Milenkovic, Bennet and N. Kashyap, "New partitionregular sequences and array codes of large girth," in Proc 42nd Annual Allerton Conf. Commun., Control Comput., Monticello, IL, 2004, pp. 240-249.
12. O. Sullivan, "Algebraic construction of sparse matrices with large girth," IEEE Trans. Inf. Theory, vol. 52, no. 2, pp. 718-727, Feb. 2006.
13. M. P. C. Fossorier, "Quasicyclic, low-density parity-check codes from circulant permutation matrices," IEEE Trans. Inf. Theory, vol. 50, no. 8, pp. 1788-1793, Aug. 2004.
14. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005. (Pubitemid 40151893)
15. L. Lan, Y. Y. Tai, L. Chen, S. Lin, and K. Abdel-Ghaffar, "A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes," IEEE Commun. Lett., vol 8, no. 7, July 2004.
16. M. Yannakakis, "Edge-deletion problems," SIAM J. Comput., vol. 10 no. 2, pp. 297-309, 1981.
17. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd edition. MIT Press and McGraw-Hill, 2001.
18. M. R. Garey and D. S. Johnson, Computers and Intractability. W. H. Freeman and company, 1979.
19. A. Natanzon, R. Shamir, and R. Sharan, "Complexity classification of some edge modification problems," Discrete Applied Mathematics, vol. 113, pp. 109-128, 2001. (Pubitemid 33732132)
20. T. Grossmana and A. Wool, "Computational experience with approximation algorithms for the set covering problem," European J. Operational Research, vol. 101, no. 1, pp. 81-92, 1997. (Pubitemid 127399917)
21. 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. (Pubitemid 32318093)
22. D. J. C. MacKay, Encyclopedia of Sparse Graph Codes. [Online]. Available: http://www.inference.phycam.ac.uk/mackay/codes/data.html.
23. S. M. Ross, Applied Probability Models with Optimization Application. Dover Publications, 1970.