OPTIMIZATION WITH EXIT FUNCTIONS OF GLDPC-STAIRCASE CODES FOR THE BEC

Ferdaouss Mattoussi; Valentin Savin; Vincent Roca; Bessem Sayadi

hal-00719321, version 1

OPTIMIZATION WITH EXIT FUNCTIONS OF GLDPC-STAIRCASE CODES FOR THE BEC

Ferdaouss Mattoussi ()^b^, 1, Valentin Savin ()^a^, 2, Vincent Roca (, )^b^, 1, Bessem Sayadi ()^c^, 3

SPAWC 2012 - 13th IEEE Internation Workshop on Signal Processing Advances in Wireless Communications (2012)

Résumé : In a previous work we introduced the Generalized LDPC- Staircase codes for the Binary Erasure Channel, based on LDPC-Staircase codes and Reed Solomon as component codes. In this paper we perform an asymptotic analysis, in terms of EXtrinsic Information Transfer functions and we de- rive an upper bound of the ML decoding threshold based on the area theorem. We use this analysis to study the impact of the internal LDPC-Staircase code rate on the performance, and show that the proposed Generalized LDPC-Staircase codes closely approach the channel capacity, with only a small number (E = 2, 3) of extra-repair symbols per check node.

a – CEA - LETI
b – INRIA
c – ALCATEL
1 : PLANETE (INRIA Sophia Antipolis / INRIA Grenoble Rhône-Alpes)
INRIA
2 : Laboratoire d'Electronique et des Technologies de l'Information (LETI)
CEA : DRT/LETI
3 : Alcatel Lucent Bell Labs
ALCATEL

hal-00719321, version 1
http://hal.inria.fr/hal-00719321
oai:hal.inria.fr:hal-00719321
Contributeur : Vincent Roca <>
Soumis le : Jeudi 19 Juillet 2012, 15:03:46
Dernière modification le : Mardi 21 Août 2012, 15:16:58

Voir la fiche détaillée

Documents associés

PDF :

Exporter

Bibtex EndNote TEI RefWorks

<?xml version="1.0" encoding="UTF-8"?>
<listBibl xmlns="http://www.tei-c.org/ns/1.0" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML">
<listBibl type="inproceedings"><head>Communications avec actes</head>
<biblStruct type="inproceedings" xml:id="hal-00719321"><analytic>
<author><persName><forename>Ferdaouss</forename><surname>Mattoussi</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Sophia Antipolis / INRIA Grenoble Rhône-Alpes</orgName>
<orgName type="team">PLANETE</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
</affiliation>
</author>
<author><persName><forename>Valentin</forename><surname>Savin</surname></persName>
<affiliation>
<orgName type="laboratory">LETI</orgName>
<orgName type="team">Laboratoire d'Electronique et des Technologies de l'Information</orgName>
<country>FR</country>
<orgName type="institution">CEA : DRT/LETI</orgName>
</affiliation>
</author>
<author><persName><forename>Vincent</forename><surname>Roca</surname></persName>
<affiliation>
<orgName type="laboratory">INRIA Sophia Antipolis / INRIA Grenoble Rhône-Alpes</orgName>
<orgName type="team">PLANETE</orgName>
<country>FR</country>
<orgName type="institution">INRIA</orgName>
</affiliation>
</author>
<author><persName><forename>Bessem</forename><surname>Sayadi</surname></persName>
<affiliation>
<orgName type="team">Alcatel Lucent Bell Labs</orgName>
<country>FR</country>
<orgName type="institution">ALCATEL</orgName>
</affiliation>
</author>
<title type="main" level="a">OPTIMIZATION WITH EXIT FUNCTIONS OF GLDPC-STAIRCASE CODES FOR THE BEC</title></analytic><monogr><meeting>SPAWC 2012 - 13th IEEE Internation Workshop on Signal Processing Advances in Wireless Communications</meeting><imprint><pubPlace><settlement>CESME</settlement><country>Turquie</country></pubPlace><biblScope type="publicationDate">2012-06-17</biblScope></imprint></monogr><idno type="HALid">http://hal.inria.fr/hal-00719321</idno><idno type="HALFile">http://hal.inria.fr/hal-00719321/PDF/spawc12_EXIT_function_GLDPC_Staircase_codes_final.pdf</idno></biblStruct>
</listBibl>
</listBibl>