Designing LDPC codes without small trapping sets by using Tanner graph covers

Miloš Ivković, Shashi Kiran Chilappagari, Bane V Vasic

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

4 Citations (Scopus)

Abstract

We present a method for lowering the error floor of low-density parity check (LDPC) codes. It is based on Tanner graph covers that do not have trapping sets from the original code. The advantages of the method are that it is universal, as it can be applied to any LDPC code/channel model/decoding algorithm and it improves performance at the expense of increasing the code length, without losing the code regularity, without changing the decoding algorithm, and, under certain conditions, without lowering the code rate. We illustrate the method by modifying Tanner, MacKay and Margulis codes to improve performance on the binary symmetric channel (BSC) under the Gallager B decoding algorithm.

Original languageEnglish (US)
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
Pages2266-2270
Number of pages5
DOIs
StatePublished - 2007
Event2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France
Duration: Jun 24 2007Jun 29 2007

Other

Other2007 IEEE International Symposium on Information Theory, ISIT 2007
CountryFrance
CityNice
Period6/24/076/29/07

Fingerprint

Decoding

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Ivković, M., Chilappagari, S. K., & Vasic, B. V. (2007). Designing LDPC codes without small trapping sets by using Tanner graph covers. In IEEE International Symposium on Information Theory - Proceedings (pp. 2266-2270). [4557557] https://doi.org/10.1109/ISIT.2007.4557557

Designing LDPC codes without small trapping sets by using Tanner graph covers. / Ivković, Miloš; Chilappagari, Shashi Kiran; Vasic, Bane V.

IEEE International Symposium on Information Theory - Proceedings. 2007. p. 2266-2270 4557557.

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

Ivković, M, Chilappagari, SK & Vasic, BV 2007, Designing LDPC codes without small trapping sets by using Tanner graph covers. in IEEE International Symposium on Information Theory - Proceedings., 4557557, pp. 2266-2270, 2007 IEEE International Symposium on Information Theory, ISIT 2007, Nice, France, 6/24/07. https://doi.org/10.1109/ISIT.2007.4557557
Ivković M, Chilappagari SK, Vasic BV. Designing LDPC codes without small trapping sets by using Tanner graph covers. In IEEE International Symposium on Information Theory - Proceedings. 2007. p. 2266-2270. 4557557 https://doi.org/10.1109/ISIT.2007.4557557
Ivković, Miloš ; Chilappagari, Shashi Kiran ; Vasic, Bane V. / Designing LDPC codes without small trapping sets by using Tanner graph covers. IEEE International Symposium on Information Theory - Proceedings. 2007. pp. 2266-2270
@inproceedings{bb2df3ca45b14b11a4ff1dff9339c4cc,
title = "Designing LDPC codes without small trapping sets by using Tanner graph covers",
abstract = "We present a method for lowering the error floor of low-density parity check (LDPC) codes. It is based on Tanner graph covers that do not have trapping sets from the original code. The advantages of the method are that it is universal, as it can be applied to any LDPC code/channel model/decoding algorithm and it improves performance at the expense of increasing the code length, without losing the code regularity, without changing the decoding algorithm, and, under certain conditions, without lowering the code rate. We illustrate the method by modifying Tanner, MacKay and Margulis codes to improve performance on the binary symmetric channel (BSC) under the Gallager B decoding algorithm.",
author = "Miloš Ivković and Chilappagari, {Shashi Kiran} and Vasic, {Bane V}",
year = "2007",
doi = "10.1109/ISIT.2007.4557557",
language = "English (US)",
isbn = "1424414296",
pages = "2266--2270",
booktitle = "IEEE International Symposium on Information Theory - Proceedings",

}

TY - GEN

T1 - Designing LDPC codes without small trapping sets by using Tanner graph covers

AU - Ivković, Miloš

AU - Chilappagari, Shashi Kiran

AU - Vasic, Bane V

PY - 2007

Y1 - 2007

N2 - We present a method for lowering the error floor of low-density parity check (LDPC) codes. It is based on Tanner graph covers that do not have trapping sets from the original code. The advantages of the method are that it is universal, as it can be applied to any LDPC code/channel model/decoding algorithm and it improves performance at the expense of increasing the code length, without losing the code regularity, without changing the decoding algorithm, and, under certain conditions, without lowering the code rate. We illustrate the method by modifying Tanner, MacKay and Margulis codes to improve performance on the binary symmetric channel (BSC) under the Gallager B decoding algorithm.

AB - We present a method for lowering the error floor of low-density parity check (LDPC) codes. It is based on Tanner graph covers that do not have trapping sets from the original code. The advantages of the method are that it is universal, as it can be applied to any LDPC code/channel model/decoding algorithm and it improves performance at the expense of increasing the code length, without losing the code regularity, without changing the decoding algorithm, and, under certain conditions, without lowering the code rate. We illustrate the method by modifying Tanner, MacKay and Margulis codes to improve performance on the binary symmetric channel (BSC) under the Gallager B decoding algorithm.

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

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

U2 - 10.1109/ISIT.2007.4557557

DO - 10.1109/ISIT.2007.4557557

M3 - Conference contribution

AN - SCOPUS:51649104324

SN - 1424414296

SN - 9781424414291

SP - 2266

EP - 2270

BT - IEEE International Symposium on Information Theory - Proceedings

ER -