Hybrid hard-decision iterative decoding of regular low-density parity-check codes

IEEE Communications Letters

Volumn 8, Issue 4, 2004, Pages 250-252

  Zarrinkhat, Pirouz ^a   Banihashemi, Amir H ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Density evolution; Hybrid decoding; Iterative coding schemes; Low density parity check (LDPC) codes; Message passing decoding algorithms

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; ERROR CORRECTION; ERRORS; OPTIMIZATION; PROBABILITY;

HYBRID HARD-DECISION ITERATIVE DECODING; LOW-DENSITY PARITY-CHECK CODES; MESSAGE-PASSING DECODING ALGORITHMS;

DECODING;

EID: 2442485766     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2004.827438     Document Type: Article

References (3)

1. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
2. P. Zarrinkhat and A. H. Banihashemi, "Density evolution and convergence properties of majority-based algorithms for decoding low-density parity-check (LDPC) codes," in Proc. 2002 Allerton Conf., IL, USA, pp. 1425-1434.
3. 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, pp. 599-618, 2001.