On universal LDPC code ensembles

Author

Sason, Igal ; Shuval, Boaz

Author_Institution

Dept. of Electr. Eng., Technion - Israel Inst. of Technol., Haifa, Israel

fYear

2010

fDate

13-18 June 2010

Firstpage

689

Lastpage

693

Abstract

A universal design of low-density parity-check (LDPC) code ensembles which enables to operate reliably over various channels is of great theoretical and practical interest. This paper considers the universality of LDPC code ensembles over multitude memoryless binary-input output-symmetric (MBIOS) channels, addressing their universality under belief-propagation (BP) decoding. Based on the density evolution approach, analytical results related to the universality of LDPC code ensembles under BP decoding are derived; these results are expressed in closed form, and are easy to calculate. The full paper version related to this work provides further results, full proofs, additional discussions on the theorems, and it also considers the universality issue under ML decoding.

Keywords

parity check codes; telecommunication channels; telecommunication network reliability; belief propagation decoding; density evolution; memoryless binary input output symmetric channels; universal LDPC code; Algorithm design and analysis; Block codes; Iterative algorithms; Iterative decoding; Iterative methods; Parity check codes; Performance analysis; Reliability theory; Sections; Sparse matrices; Belief propagation (BP); Bhattacharyya parameter (B-parameter); density evolution (DE); low-density parity-check (LDPC) codes; memoryless binary-input output-symmetric (MBIOS) channels;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory Proceedings (ISIT), 2010 IEEE International Symposium on

Conference_Location

Austin, TX

Print_ISBN

978-1-4244-7890-3

Electronic_ISBN

978-1-4244-7891-0

Type

conf

DOI

10.1109/ISIT.2010.5513584

Filename

5513584