Transactions papers: Evaluation and design of irregular LDPC codes using ACE spectrum

IEEE Transactions on Communications

Volumn 57, Issue 8, 2009, Pages 2272-2279

  Vukobratović, Dejan ^a   Šenk, Vojin ^a  

^a UNIVERSITY OF NOVI SAD   (Serbia)

Author keywords

Approximate cycle extrinsic message degree (ACE); Error floor; Irregular low density parity check (LDPC) codes; Iterative decoding, stopping sets

Indexed keywords

ANALYTICAL SOLUTIONS; APPROXIMATE CYCLE EXTRINSIC MESSAGE DEGREE (ACE); BINARY ERASURE CHANNEL; CONSTRAINED DESIGN; ERROR FLOOR; IRREGULAR LDPC CODES; IRREGULAR LOW-DENSITY PARITY-CHECK (LDPC) CODES; LDPC CODES; RESEARCH PROBLEMS; SIMULATION RESULT; STOPPING SET;

BUILDING CODES; CODING ERRORS; DESIGN; FLOORS; HEURISTIC ALGORITHMS; ITERATIVE DECODING; SET THEORY;

CODES (SYMBOLS);

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

References (20)

1. T. J. Richardson and R. L. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
2. Pseudocodewords homepage [online]. Availble: http:// www.pseudocodewords.info.
3. F. Peng, W. E. Ryan, and R. D. Wessel, "Surrogate-channel design of universal LDPC codes," IEEE Commun. Lett., vol. 10, no. 6, pp. 480-482, June 2006.
4. C. Di, D. Proietti, E. Teletar, I J. Richardson, and R. L. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, no. 6, pp. 1570-1579, June 2002.
5. A. Vardy and M. Schwartz, "On the stopping distance and the stopping redundancy of codes," IEEE Trans. Inform. Theory, vol. 52, no. 3, pp. 922-932, Mar. 2006.
6. C. C. Wang, S. R. Kulkarni, and H. V. Poor, "Exhausting error-prone patterns in LDPC codes," preprint, submitted to IEEE Trans. Inform. TSeory [Online]. Available: ArXiv:cs.IT/0609046.
7. T. Tian, C. Jones, J. D. Villasenor, and R. D. Wesel, "Selective avoidance of cycles in irregular LDPC code construction," IEEE Trans. Commun., vol. 52, no. 8, pp. 1242-1248, Aug. 2004.
8. K. M. Krishnan and P. Shankar, "Computing the stopping distance of a Tanner graph is NP-hard," IEEE Trans. Inform. Theory, vol. 53, no. 6, pp. 2278-2280, June 2007.
9. Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge growth Tanner graphs," IEEE Trans. Inform. Theory vol. 51, no. 1, pp. 386-398, Jan. 2005.
10. DE LDPC Code Optimizer [Online]. Available: http://Ithewww.epfl.ch/ research/ldpcopt/
11. M. Yang, W. E. Ryan, and Y. Li, "Design of efficiently encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun. vol. 52, no. 4, pp. 564-571, Apr. 2004.
12. W. Weng, A. Ramamoorthy, and R. D. Wesel, "Lowering the error floors of high-rate LDPC codes by graph conditioning," in Proc. IEEE VTC Fall Conf., Los Angeles, CA, USA, 2004.
13. A. Ramamoorthy and R. D. Wesel, "Expansion properties of generalized ACE codes," in Proc. Annual Allerton Conf., Monticello, IL, USA, 2004.
14. D. J. C. MacKay and M. Postol, "Weakness of Margulis and Ramanujan-Margulis low-density parity-check codes," Electronic Notes Theoretical Computer Science, vol. 74, 2003.
15. T. Richardson, "Error floors of LDPC codes," in Proc. Annual Allerton Conf., Monticello, IL, USA, 2003.
16. L. Dinoi, E Sottile, S. Benedetto, "Design of variable-rate, irregular LDPC codes with low error floor," in Proc. IEEE ICC Conf., pp. 647-651, Seoul, South Korea, 2005.
17. G. Richter and A. Hof, "On a construction method of irregular LDPC codes without small stopping sets," in Proc. IEEE ICC Conf., Istambul, Turkey, 2006.
18. J. Chen, R. M. Tanner, J. Zhang, and M. P. C, Fossorier, "Construction of irregular LDPC codes by quasi-cyclic extension," IEEE Trans. Inform. Theory, vol. 53, no. 4, pp. 1479-1483, Apr. 2007.
19. D. Vukobratović and V. Šenk, "Generalized ACE constrained progressive edge growth LDPC code design," IEEE Commun. Lett., vol. 12, no. 1, pp. 32-34, Jan. 2008.
20. H. Xiao and A. H. Banibashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes," IEEE Commun. Lett., vol. 8, No. 12, pp. 715-718, Dec. 2004.