Approximately lower triangular ensembles of LPDC codes with linear encoding complexity

Shay Freundlich, David Burshtein, Simon Litsyn

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

Abstract

The complexity of brute force encoding of LDPC codes is proportional to the square value of the block length. Richardson and Urbanke have proposed efficient encoding algorithms for LDPC codes. These algorithms permute the parity check matrix of the code iteratively, such that it becomes approximately lower triangular. We propose a new approach for efficient encoding of LDPC codes in which we modify the code ensemble to force an approximate lower triangular structure, thus eliminating the need to apply the algorithms of Richardson and Urbanke. We prove that the new ensemble has the same asymptotic threshold as the corresponding standard ensemble. The new ensemble can be used for linear time encoding of an arbitrary code profile. Computer simulations confirm that the performances of the standard and new ensembles are also very similar when using finite length codes.

Original languageEnglish
Title of host publicationProceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Pages821-825
Number of pages5
DOIs
StatePublished - 2006
Event2006 IEEE International Symposium on Information Theory, ISIT 2006 - Seattle, WA, United States
Duration: 9 Jul 200614 Jul 2006

Publication series

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

Conference

Conference2006 IEEE International Symposium on Information Theory, ISIT 2006
Country/TerritoryUnited States
CitySeattle, WA
Period9/07/0614/07/06

Fingerprint

Dive into the research topics of 'Approximately lower triangular ensembles of LPDC codes with linear encoding complexity'. Together they form a unique fingerprint.

Cite this