Error floors of LDPC codes on the binary symmetric channel

Shashi Kiran Chilappagari, Sundararajan Sankaranarayanan, Bane V Vasic

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

76 Citations (Scopus)

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 publicationIEEE International Conference on Communications
Pages1089-1094
Number of pages6
Volume3
DOIs
StatePublished - 2006
Event2006 IEEE International Conference on Communications, ICC 2006 - Istanbul, Turkey
Duration: Jul 11 2006Jul 15 2006

Other

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

ASJC Scopus subject areas

  • Media Technology

Cite this

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

Error floors of LDPC codes on the binary symmetric channel. / Chilappagari, Shashi Kiran; Sankaranarayanan, Sundararajan; Vasic, Bane V.

IEEE International Conference on Communications. Vol. 3 2006. p. 1089-1094 4024284.

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

Chilappagari, SK, Sankaranarayanan, S & Vasic, BV 2006, Error floors of LDPC codes on the binary symmetric channel. in IEEE International Conference on Communications. vol. 3, 4024284, pp. 1089-1094, 2006 IEEE International Conference on Communications, ICC 2006, Istanbul, Turkey, 7/11/06. https://doi.org/10.1109/ICC.2006.254892
Chilappagari SK, Sankaranarayanan S, Vasic BV. Error floors of LDPC codes on the binary symmetric channel. In IEEE International Conference on Communications. Vol. 3. 2006. p. 1089-1094. 4024284 https://doi.org/10.1109/ICC.2006.254892
Chilappagari, Shashi Kiran ; Sankaranarayanan, Sundararajan ; Vasic, Bane V. / Error floors of LDPC codes on the binary symmetric channel. IEEE International Conference on Communications. Vol. 3 2006. pp. 1089-1094
@inproceedings{e0b9d5680969457aaa28b8ee72de7a48,
title = "Error floors of LDPC codes on the binary symmetric channel",
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.",
author = "Chilappagari, {Shashi Kiran} and Sundararajan Sankaranarayanan and Vasic, {Bane V}",
year = "2006",
doi = "10.1109/ICC.2006.254892",
language = "English (US)",
isbn = "1424403553",
volume = "3",
pages = "1089--1094",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - Error floors of LDPC codes on the binary symmetric channel

AU - Chilappagari, Shashi Kiran

AU - Sankaranarayanan, Sundararajan

AU - Vasic, Bane V

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=42549151620&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=42549151620&partnerID=8YFLogxK

U2 - 10.1109/ICC.2006.254892

DO - 10.1109/ICC.2006.254892

M3 - Conference contribution

AN - SCOPUS:42549151620

SN - 1424403553

SN - 9781424403554

VL - 3

SP - 1089

EP - 1094

BT - IEEE International Conference on Communications

ER -