Iterative decoding of linear block codes: A parity-check orthogonalization approach

IEEE Transactions on Information Theory

Volumn 51, Issue 9, 2005, Pages 3347-3353

  Sankaranarayanan, Sundararajan ^a   Vasić, Bane ^a  

^a University of Arizona   (United States)

Author keywords

Auxiliary checks; Auxiliary variables; Belief propagation algorithm; Four cycles; Tanner graphs (TGs)

Indexed keywords

ALGORITHMS; BIT ERROR RATE; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; DECODING; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; WHITE NOISE;

AUXILIARY CHECKS; AUXILIARY VARIABLES; BELIEF PROPAGATION ALGORITHM; LINEAR BLOCK CODES; MESSAGE PASSING ALGORITHMS; TANNER GRAPHS (TGS);

BLOCK CODES;

EID: 26444580184     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.853321     Document Type: Article

References (13)

1. A. R. Calderbank, G. D. Forney, and A. Vardy "Minimal tail-biting trellises: The Golay code and more," IEEE Trans. Inf. Theory, vol. 45, no. 4, pp. 1435-1455, Jul. 1999.
2. C. Di, D. Proietti, T. Richardson, I. E. Telatar, and R. Urbanke, "Finite length analysis of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
3. T. Etzion, A. Trachtenberg, and A. Vardy, "Which codes have cycle-free Tanner graphs?," IEEE Trans. Inf. Theory, vol. 45, no. 6, pp. 2173-2181, Sep. 1999.
4. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
5. G. D. Forney, Jr., "Codes on graphs: Normal realizations," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 520-548, Feb. 2001.
6. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
7. D. J. C. MacKay, "Relationships between sparse graph codes," in Proc. Information-Based Induction Sciences, Japan, 2000. Available: [Online] at http://www.inference.phy.cam.ac.uk/mackaylabstracts/ ibis.html.
8. R. J. McEliece, "On the BCJR trellis for linear block codes," IEEE Trans. Inf. Theory, vol. 42, no. 4, pp. 1072-1092, Jul. 1996.
9. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 5, pp. 533-547, Sep. 1981.
10. J.Xu and S. Lin, "A combinatoric superposition method for constructing low-density parity-check codes," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 30.
11. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Eump. Trans. Telecomm., vol. 6, pp. 513-525, Sep./Oct. 1995.
12. N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Univ. Linköping, Link-dsoping, Sweden, 1996.
13. J. S. Yedidia, J. Chen, and M. C. Fossorier, "Generating code representations suitable for belief propagation decoding," in Proc. 40th Annu. Allerton Conf. Communications, Control, and Computing, Monticello, IL, Oct. 2002.