Generating good finite length ldpc codes based on lifted graphs

Eran Sharon; Simon Litsyn

Generating good finite length ldpc codes based on lifted graphs

Eran Sharon, Simon Litsyn

School of Electrical Engineering

Tel Aviv University

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

4 Scopus citations

Abstract

A method for generating good finite length Low- Density Parity-Check (LDPC) codes based on lifted graphs is described. The codes are constructed using a progressive edge growth technique by taking into account the influence that every introduced edge has on the error floor and waterfall threshold of the code. The generated code can be tailored according to prescribed specification, achieving the desirable error floor versus waterfall threshold trade-off. For the constructed codes, an analytical upper bound on the expected block error probability of the code over the Binary Erasure Channel (BEC) in the error floor region and an asymptotic Density Evolution (DE) waterfall threshold are obtained.

Original language	English
Title of host publication	44th Annual Allerton Conference on Communication, Control, and Computing 2006
Publisher	University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages	41-50
Number of pages	10
ISBN (Electronic)	9781604237924
State	Published - 2006
Event	44th Annual Allerton Conference on Communication, Control, and Computing 2006 - Monticello, United States Duration: 27 Sep 2006 → 29 Sep 2006

Publication series

Name	44th Annual Allerton Conference on Communication, Control, and Computing 2006
Volume	1

Conference

Conference	44th Annual Allerton Conference on Communication, Control, and Computing 2006
Country/Territory	United States
City	Monticello
Period	27/09/06 → 29/09/06

Cite this

Sharon, E., & Litsyn, S. (2006). Generating good finite length ldpc codes based on lifted graphs. In 44th Annual Allerton Conference on Communication, Control, and Computing 2006 (pp. 41-50). (44th Annual Allerton Conference on Communication, Control, and Computing 2006; Vol. 1). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

Sharon, Eran ; Litsyn, Simon. / Generating good finite length ldpc codes based on lifted graphs. 44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2006. pp. 41-50 (44th Annual Allerton Conference on Communication, Control, and Computing 2006).

@inproceedings{98e4051a23e94e5ea2b9dfa6f336be51,

title = "Generating good finite length ldpc codes based on lifted graphs",

abstract = "A method for generating good finite length Low- Density Parity-Check (LDPC) codes based on lifted graphs is described. The codes are constructed using a progressive edge growth technique by taking into account the influence that every introduced edge has on the error floor and waterfall threshold of the code. The generated code can be tailored according to prescribed specification, achieving the desirable error floor versus waterfall threshold trade-off. For the constructed codes, an analytical upper bound on the expected block error probability of the code over the Binary Erasure Channel (BEC) in the error floor region and an asymptotic Density Evolution (DE) waterfall threshold are obtained.",

author = "Eran Sharon and Simon Litsyn",

year = "2006",

language = "אנגלית",

series = "44th Annual Allerton Conference on Communication, Control, and Computing 2006",

publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

pages = "41--50",

booktitle = "44th Annual Allerton Conference on Communication, Control, and Computing 2006",

note = "44th Annual Allerton Conference on Communication, Control, and Computing 2006 ; Conference date: 27-09-2006 Through 29-09-2006",

}

Sharon, E & Litsyn, S 2006, Generating good finite length ldpc codes based on lifted graphs. in 44th Annual Allerton Conference on Communication, Control, and Computing 2006. 44th Annual Allerton Conference on Communication, Control, and Computing 2006, vol. 1, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 41-50, 44th Annual Allerton Conference on Communication, Control, and Computing 2006, Monticello, United States, 27/09/06.

Generating good finite length ldpc codes based on lifted graphs. / Sharon, Eran; Litsyn, Simon.
44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2006. p. 41-50 (44th Annual Allerton Conference on Communication, Control, and Computing 2006; Vol. 1).

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

TY - GEN

T1 - Generating good finite length ldpc codes based on lifted graphs

AU - Sharon, Eran

AU - Litsyn, Simon

PY - 2006

Y1 - 2006

N2 - A method for generating good finite length Low- Density Parity-Check (LDPC) codes based on lifted graphs is described. The codes are constructed using a progressive edge growth technique by taking into account the influence that every introduced edge has on the error floor and waterfall threshold of the code. The generated code can be tailored according to prescribed specification, achieving the desirable error floor versus waterfall threshold trade-off. For the constructed codes, an analytical upper bound on the expected block error probability of the code over the Binary Erasure Channel (BEC) in the error floor region and an asymptotic Density Evolution (DE) waterfall threshold are obtained.

AB - A method for generating good finite length Low- Density Parity-Check (LDPC) codes based on lifted graphs is described. The codes are constructed using a progressive edge growth technique by taking into account the influence that every introduced edge has on the error floor and waterfall threshold of the code. The generated code can be tailored according to prescribed specification, achieving the desirable error floor versus waterfall threshold trade-off. For the constructed codes, an analytical upper bound on the expected block error probability of the code over the Binary Erasure Channel (BEC) in the error floor region and an asymptotic Density Evolution (DE) waterfall threshold are obtained.

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:84940661495

T3 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

SP - 41

EP - 50

BT - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

T2 - 44th Annual Allerton Conference on Communication, Control, and Computing 2006

Y2 - 27 September 2006 through 29 September 2006

ER -

Sharon E, Litsyn S. Generating good finite length ldpc codes based on lifted graphs. In 44th Annual Allerton Conference on Communication, Control, and Computing 2006. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2006. p. 41-50. (44th Annual Allerton Conference on Communication, Control, and Computing 2006).

Generating good finite length ldpc codes based on lifted graphs

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this