Analysis and design of moderate length regular LDPC codes with low error floors

2006 IEEE Conference on Information Sciences and Systems, CISS 2006 - Proceedings

Volumn , Issue , 2006, Pages 823-828

  Cole, Chad A ^a   Wilson, Stephen G ^a   Hall, Eric K ^b   Giallorenzi, Thomas R ^b  

^a UNIVERSITY OF VIRGINIA   (United States)

^b L 3 Communications   (United States)

Author keywords

Error floors; LDPC; Trapping sets

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; MESSAGE PASSING; PROBABILITY; SIGNAL TO NOISE RATIO;

ERROR FLOORS; LDPC CODES; MESSAGE PASSING ALGORITHMS; TRAPPING SETS;

CODES (SYMBOLS);

EID: 44049099651     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISS.2006.286581     Document Type: Conference Paper

References (17)

1. D.M. Arnold, E. Eleftheriou, and X.Y. Hu. Progressive edge-growth Tanner graphs. IEEE GlobeCom '01, 2:995-1001, Nov 2001.
2. C. Berrou, S. Vaton, M. Jezequel, and C. Douillard. Computing the minimum distance of linear codes by the error impulse method. IEEE GlobeCom'02, 2:1017-1020, Nov 2002.
3. E. Cavus, C. Haymes, and B. Daneshrad. A highly efficient importance sampling method for performance evaluation of LDPC codes at very low bit error rates. Submitted, IEEE TCOM.
4. R. Holzlohner, A. Mahadevan, C.R. Menyuk, J.M. Morris, and J. Zweck. Evaluation of the very low BER of FEC codes using dual adaptive importance sampling. IEEE Comm. Letters, 2, Feb 2005.
5. X.-Y. Hu, M. P. C. Fossorier, and E. Eleftheriou. On the computation of the minimum distance of LDPC codes. IEEE ICC04, 2004.
6. D.C. Mackay. Mackay codes web site. http://www.inference.phy.cam.ac. uk/mackay/codes.
7. Y. Mao and A. Banihashemi. A heuristic search for good LDPC codes at short block lengths. Proc. IEEE Intl. Conf. Commun. (ICC), pages 41-44, 2001.
8. G. A. Margulis. Explicit constructions of graphs without short cycles and low-density codes. Combinatorica, 2(1):71-78, 1982.
9. O. Milenkovic, E. Soljanin, and P. Whiting. Asymptotic spectra of trapping sets in regular and irregular LDPC code ensembles. Submitted IEEE Trans. Information Theory, 2005.
10. T. Richardson. Error floors of LDPC codes. Allerton Conference, 2001.
11. J. S. Sadowsky and J. A. Bucklew. On large deviation theory and asymptotically efficient Monte-Carlo estimation. IEEE Tran, on IT, 36(3):579-588, May 1990.
12. R. Srinivasan. Importance Sampling - Applications in Communications and Detection. Springer-Verlag, 2002.
13. R. M. Tanner. A recursive approach to low complexity codes. IEEE Tran. on IT, 27(5):533-547, Sept 1981.
14. L. Wei. Several properties of short LDPC codes. IEEE TCOM, 52(5):721-727, May 2004.
15. X. Wu. IS - Block and Convolutional Codes. Master's thesis, University of Virginia, May 1995.
16. B. Xia and W.E. Ryan. On importance sampling for linear block codes. In Proc. IEEE ICC, volume 4, pages 2904-2908, May 2003.
17. T. Zhang and K.K. Parhi. Joint (3,k)-regular ldpc code and decoder/encoder design. IEEE Trans. Signal Proc., 52(4): 1065-1079, April 2004.