Selective avoidance of cycles in irregular LDPC code construction

IEEE Transactions on Communications

Volumn 52, Issue 8, 2004, Pages 1242-1247

  Tian, Tao ^a   Jones, Christopher R ^a   Villasenor, John D ^a   Wesel, Richard D ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BIT ERROR RATE; BLOCK CODES; COMPUTER SIMULATION; DECODING; GRAPH THEORY; ITERATIVE METHODS; SET THEORY; THEOREM PROVING;

CODE CONSTRUCTION; CYCLE CLUSTERING; ERROR FLOOR PERFORMANCE; EXTRINSIC MESSAGE DEGREE; ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES; MESSAGE PASSING DECODING; UNSTRUCTURED GRAPH CONSTRUCTION; VITERBI LIKE ALGORITHM;

SIGNAL ENCODING;

EID: 4444318644     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.833048     Document Type: Article

References (13)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
2. M. Luby, M. Mitzenmacher, A. Shokrollahi, and D. Spielman, "Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
3. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Francisco, CA: Morgan Kaufmann, 1988.
4. S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, "Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding," IEEE Trans. Inform. Theory, vol. 44, pp. 909-926, May 1998.
5. C. Fragouli and R. D. Wesel, "Bit vs. symbol interleaving for parallel concatenated trellis-coded modulation," in Proc. IEEE Global Telecommunications Conf., vol. 2, San Antonio, TX, Nov. 2001, pp. 931-935.
6. D. J. C. MacKay, S. T. Wilson, and M. C. Davey, "Comparison of constructions of irregular Gallager codes," IEEE Trans. Commun., vol. 47, pp. 1449-1454, Oct. 1999.
7. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
8. T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 638-656, Feb. 2001.
9. Y. Mao and A. H. Banihashemi, "A heuristic search for good low-density parity-check codes at short block lengths," in Proc. IEEE Int. Conf. Communications, vol. 1, Helsinki, Finland, June 2001, pp. 41-44.
10. D. M. Arnold, E. Eleftheriou, and X. Y. Hu, "Progressive edge-growth Tanner graphs," in Proc. IEEE Global Telecommunications Conf., vol. 2, San Antonio, TX, Nov. 2001, pp. 995-1001.
11. C. Di, D. Proietti, E. Telatar, T. Richardson, and R. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inform. Theory, vol. 48, pp. 1570-1579, June 2002.
12. G. A. Margulis, "Explicit construction of graphs without short cycles and low density codes," Combinatorica, vol. 2, no. 1, pp. 71-78, 1982.
13. M. Yang and W. E. Ryan, "Lowering the error-rate floors of moderate-length high-rate irregular LDPC codes," in IEEE Int. Symp. Information Theory, Yokohama, Japan, June 2003, p. 237.