Generating good finite length ldpc codes based on lifted graphs

Eran Sharon, Simon Litsyn

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication44th Annual Allerton Conference on Communication, Control, and Computing 2006
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages41-50
Number of pages10
ISBN (Electronic)9781604237924
StatePublished - 2006
Event44th Annual Allerton Conference on Communication, Control, and Computing 2006 - Monticello, United States
Duration: 27 Sep 200629 Sep 2006

Publication series

Name44th Annual Allerton Conference on Communication, Control, and Computing 2006
Volume1

Conference

Conference44th Annual Allerton Conference on Communication, Control, and Computing 2006
Country/TerritoryUnited States
CityMonticello
Period27/09/0629/09/06

Fingerprint

Dive into the research topics of 'Generating good finite length ldpc codes based on lifted graphs'. Together they form a unique fingerprint.

Cite this