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

Miloš Ivković; Shashi Kiran Chilappagari; Bane Vasić

doi:10.1109/ISIT.2007.4557557

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

Miloš Ivković, Shashi Kiran Chilappagari, Bane Vasić

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

5 Scopus citations

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 language	English (US)
Title of host publication	Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007
Pages	2266-2270
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2007.4557557
State	Published - 2007
Event	2007 IEEE International Symposium on Information Theory, ISIT 2007 - Nice, France Duration: Jun 24 2007 → Jun 29 2007

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings
ISSN (Print)	2157-8101

Other

Other	2007 IEEE International Symposium on Information Theory, ISIT 2007
Country/Territory	France
City	Nice
Period	6/24/07 → 6/29/07

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2007.4557557

Cite this

Designing LDPC codes without small trapping sets by using Tanner graph covers. / Ivković, Miloš; Chilappagari, Shashi Kiran; Vasić, Bane.
Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007. 2007. p. 2266-2270 4557557 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Ivković, M, Chilappagari, SK & Vasić, B 2007, Designing LDPC codes without small trapping sets by using Tanner graph covers. in Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007., 4557557, IEEE International Symposium on Information Theory - Proceedings, 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

@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{\v s} Ivkovi{\'c} and Chilappagari, {Shashi Kiran} and Bane Vasi{\'c}",

year = "2007",

doi = "10.1109/ISIT.2007.4557557",

language = "English (US)",

isbn = "1424414296",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "2266--2270",

booktitle = "Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007",

note = "2007 IEEE International Symposium on Information Theory, ISIT 2007 ; Conference date: 24-06-2007 Through 29-06-2007",

}

TY - GEN

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

AU - Ivković, Miloš

AU - Chilappagari, Shashi Kiran

AU - Vasić, Bane

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

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 2266

EP - 2270

BT - Proceedings - 2007 IEEE International Symposium on Information Theory, ISIT 2007

T2 - 2007 IEEE International Symposium on Information Theory, ISIT 2007

Y2 - 24 June 2007 through 29 June 2007

ER -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this