An efficient message-passing schedule for LDPC decoding

IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings

Volumn , Issue , 2004, Pages 223-226

  Sharon, Eran ^a   Litsyn, Simon ^a   Goldberger, Jacob ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF-PROPAGATION ALGORITHM (BP); CYCLE-FREE BIPARTITE GRAPH; DENSITY EVOLUTION (DE); LOW-DENSITY PARITY-CHECK (LDPC);

ALGORITHMS; APPROXIMATION THEORY; ENCODING (SYMBOLS); GRAPH THEORY; SET THEORY; THEOREM PROVING;

DECODING;

EID: 17444419769     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. G.D. Forney Jr., "On iterative decoding and the two-way algorithm," Proc. Int. Symp. on Turbo Codes and Related Topics, pp. 12-15, 1997.
2. J. Zhang and M. Fossorier, "Shuffled belief propagation decoding," The Proceedings 36th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, USA, November 2002.
3. R.G. Gallager, "Low-density parity-check codes," IRE Trans. Info. Theory, vol. IT-8, pp. 21-28, 1962.
4. H. Kfir and I. Kanter, "Parallel versus sequential updating for belief propagation decoding," submitted to Physical Review E, July 2002.
5. F.R. Kschischang, B.J. Frey and H. Loeliger, "Factor Graphs and the sum-product algorithm," IEEE Trans. on Info. Theory, 2001.
6. Y. Mao and A.H. Banihashemi, "A new schedule for decoding low-density parity-check codes," Proc. IEEE GlobeCom, Texas, 2001.
7. T.J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb, 2001.