Error floors of LDPC codes on the binary symmetric channel

Shashi Kiran Chilappagari, Sundararajan Sankaranarayanan, Bane Vasić

Research output: Chapter in Book/Report/Conference proceedingConference contribution

76 Scopus citations

Abstract

In this paper, we propose a semi-analytical method to compute error floors of LDPC codes on the binary symmetric channel decoded iteratively using the Gallager B algorithm. The error events of the decoder are characterized using combinatorial objects called trapping sets, originally defined by Richardson. In general, trapping sets are characteristic of the graphical representation of a code. We study the structure of trapping sets and explore their relation to graph parameters such as girth and vertex degrees. Using the proposed method, we compute error floors of regular structured and random LDPC codes with column weight three.

Original languageEnglish (US)
Title of host publication2006 IEEE International Conference on Communications, ICC 2006
Pages1089-1094
Number of pages6
DOIs
StatePublished - Dec 1 2006
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: Jul 11 2006Jul 15 2006

Publication series

NameIEEE International Conference on Communications
Volume3
ISSN (Print)0536-1486

Other

Other2006 IEEE International Conference on Communications, ICC 2006
CountryTurkey
CityIstanbul
Period7/11/067/15/06

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Chilappagari, S. K., Sankaranarayanan, S., & Vasić, B. (2006). Error floors of LDPC codes on the binary symmetric channel. In 2006 IEEE International Conference on Communications, ICC 2006 (pp. 1089-1094). [4024284] (IEEE International Conference on Communications; Vol. 3). https://doi.org/10.1109/ICC.2006.254892