Reduced-complexity decoding algorithm for low-density parity-check codes

Electronics Letters

Volumn 37, Issue 2, 2001, Pages 102-104

  Eleftheriou, E ^a   Mittelholzer, T ^a   Dholakia, A ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DECODING; ERROR CORRECTION;

LOW DENSITY PARITY CHECK (LDPC) CODES;

TRELLIS CODES;

EID: 0035138658     PISSN: 00135194     EISSN: None     Source Type: Journal    
DOI: 10.1049/el:20010077     Document Type: Article

References (6)

1. GALLAGER, R.G.: 'Low-density parity-check codes', IRE Trans. Inf. Theory, 1962, IT-8, pp. 21-28
2. MACKAY, D.J.C.: 'Good error-correcting codes based on very sparse matrices', IEEE Trans. Inf. Theory, 1999, 46, (2), pp. 399-431
3. FOSSORIER, M.P.C., MIHALJEVIC, M., and IMAI, H.: 'Reduced complexity iterative decoding of low-density parity check codes based on belief propagation'. IEEE Trans. Commun., 1999, 47, (5), pp. 673-680
4. ÖLÇER, S., and UNGERBOECK, G.: 'Reed-Muller coding for partial response channels'. 1993 IEEE Int. Symp. Information Theory, San Antonio, TX (IEEE, Piscataway, 1992), p. 243
5. VITERBI, A.J.: 'An intuitive justification and a simplified implementation of the MAP decoder for convolutional codes', IEEE J. Sel. Areas Commun., 1998, 16, (2), pp. 260-264
6. GROSS, W.J., and GULAK, P.C.: 'Simplified MAP algorithm suitable for implementation of turbo decoders', Electron. Lett., 1998, 34, (16), pp. 1577-1578