Decreasing the complexity of LDPC iterative decoders

IEEE Communications Letters

Volumn 9, Issue 7, 2005, Pages 634-636

  Bosco, Gabriella ^a   Montorsi, Guido ^a   Benedetto, Sergio ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Decoding complexity; Iterative decoder; LDPC codes

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; ITERATIVE METHODS; MARKOV PROCESSES; PROBABILITY;

DECODING COMPLEXITY; ITERATIVE DECODER; LOW DENSITY PARITY CHECK CODES;

CODES (SYMBOLS);

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

References (7)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, no. 18, pp. 16451646, 1996.
3. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599618, Feb. 2001.
4. C. Berrou, A. Glavieux, and P. Thitimajshima, "Near Shannon limit error-correcting coding and decoding: turbo codes," in Proc. 1993 IEEE Int. Conf. Communications, May 1993, pp. 10641070.
5. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599618, Feb. 2001.
6. J. Vogt and A. Finger, "Increasing throughput of iterative decoders," Electronics Letters, vol. 37, no. 12, Jun. 2001, pp. 770-771.
7. W. Feller, An Introduction to Probability Theory and its Applications: vol. 1. New-York: John Wiley & Sons, 1968.