Predicting error floors of structured LDPC codes: Deterministic bounds and estimates

IEEE Journal on Selected Areas in Communications

Volumn 27, Issue 6, 2009, Pages 908-917

  Dolecek, Lara ^a   Lee, Pamela ^b   Zhang, Zhengya ^b   Anantharam, Venkat ^b   Nikolic, Borivoje ^b   Wainwright, Martin ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Absorbing set; Belief propagation; Error floor; Hardware emulation; Importance sampling; LDPC codes; Near codeword; ; Pseudocodeword; Trapping set

Indexed keywords

ABSORBING SET; BELIEF PROPAGATION; ERROR FLOOR; HARDWARE EMULATION; IMPORTANCE SAMPLING; LDPC CODES; NEAR-CODEWORD; PSEUDOCODEWORD; TRAPPING SET;

ERROR CORRECTION; ESTIMATION; FADING (RADIO); FLOORS; FORECASTING; ITERATIVE DECODING; SIGNAL TO NOISE RATIO; TELECOMMUNICATION;

CODES (SYMBOLS);

EID: 73849142378     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2009.090809     Document Type: Article

References (31)

1. Digital Video Broadcasting project. Available at http://www.dvb.org.
2. IEEE Standard 802.3an. Available at http://ieeexplore.ieee.org/servlet/ opac?punumber=4039890.
3. R.S. Blum, R.J. Kozick, and B.M. Sadler. An adaptive spatial diversity receiver for non-Gaussian interference and noise. IEEE Trans. Signal Processing, pages 2100-2111, Aug. 1999.
4. J. Bucklew. Introduction to Rare Event Simulation. Springer, 2004.
5. E. Cavus, C. Haymes, and B. Daneshrad. A highly efficient importance sampling method for performance evaluation of LDPC codes at very low bit errors rates. Submitted to IEEE Trans. Commun.
6. S.K. Chilappagari, S. Sankaranarayanan, and B. Vasic. Error floors of LDPC codes on the binary symmetric channel. In IEEE Int. Conf. on Comm., June 2006.
7. C. A. Cole, S. G. Wilson, E. K. Hall, and T. R. Giallorenzi. A general method for finding low error rates of LDPC codes. Submitted to IEEE Trans. Inform. Theory, 2006.
8. L. Dolecek, Z. Zhang, V. Anantharam, M. Wainwright, and B. Nikolic. Analysis of absorbing sets of array-based LDPC codes. In IEEE Int. Conf. Comm., June 2007.
9. L. Dolecek, Z. Zhang, V. Anantharam, M. Wainwright, and B. Nikolic. Analysis of absorbing sets and fully absorbing sets of array-based LDPC codes. Submitted to IEEE Trans. Inform. Theory, 2008.
10. L. Dolecek, Z. Zhang, M. Wainwright, V. Anantharam, and B. Nikolic. Evaluation of the low frame error rate performance of LDPC codes using importance sampling. In IEEE Info. Theory Workshop, Sept. 2007.
11. E. Eleftheriou and S. Ölçer. Low density parity check codes for digital subscriber lines. In IEEE Int. Conf. on Comm., April 2002.
12. J. Fan. Array-codes as low-density parity-check codes. In 2nd Int. Symp. on Turbo Codes, Sept. 2000.
13. B. J. Frey, R. Koetter, and A. Vardy. Skewness and pseudocodewords in iterative decoding. In IEEE ISIT, August 1998.
14. R. G. Gallager. Low-density parity check codes. MIT Press, Cambridge, MA, 1963.
15. F.R. Kschischang, B.J. Frey, and H.-A. Loeliger. Factor graphs and the sum-product algorithm. IEEE Trans. Inform. Theory, 47(2):498-519, February 2001.
16. S. Laendner and O. Milenkovic. Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes. In WirelessComm, June 2005.
17. P. Lee, L. Dolecek, Z. Zhang, V. Anantharam, M. Wainwright, and B. Nikolic. Error floors in LDPC codes: fast simulation, bounds and hardware emulation. In IEEE ISIT, July 2008.
18. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman. Improved low-density parity check codes using irregular graphs. IEEE Trans. Inform. Theory, 47:585-598, February 2001.
19. D. MacKay and M. Postol. Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes. Elec. Notes in Theo. Comp. Science, 74, 2003.
20. A. Nezampour, A. Nasri, R. Schober, and Y. Ma. Asymptotic BEP and SEP of differential EGC in correlated Ricean fading and non-Gaussian noise. In IEEE GLOBECOM, Nov. 2007.
21. T. Richardson. Error floors of LDPC codes. In Allerton, Oct. 2003.
22. T. Richardson and R. Urbanke. The capacity of low-density parity-check codes under message-passing decoding. IEEE Trans. Inform. Theory, 47(2), Feb. 2001.
23. T. Richardson and R. Urbanke. Modern Coding Theory. Cambridge University Press, 2008.
24. R. J. Serfling. Approximation Theorems of Mathematical Statistics. Wiley Series in Probability and Statistics. Wiley, 1980.
25. R. M. Tanner. A recursive approach to low complexity codes. IEEE Trans. Inform. Theory, 27:533-547, September 1980.
26. Sten Brink. Convergence of iterative decoding. Electronics Letters, 35:806-808, May 1999.
27. B. Vasic and E. Kurtas. Coding and Signal Processing for Magnetic Recording Systems. CRC Press, 2005.
28. X. Wang, G. Yue, and K.R. Narayanan. Optimization of LDPC-coded CDMA systems. IEEE Trans. Signal Processing, pages 1500-1510, April 2005.
29. B. Xia and W. E. Ryan. Estimating LDPC codeword error rates via importance sampling. In IEEE ISIT, July 2004.
30. B. Xia and W. E. Ryan. Importance sampling for Tanner trees. IEEE Trans. Inform. Theory, 51:2183-2189, June 2005.
31. Z. Zhang, L. Dolecek, V. Anantharam, and M. Wainwright B. Nikolic. Quantization effects of low-density parity-check decoders. In IEEE Int. Conf. on Comm., June 2007.