<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-03428160</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-02T13:46:49+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">High performance short-block binary regular LDPC codes</title>
            <author role="aut">
              <persName>
                <forename type="first">Latifa</forename>
                <surname>Mostari</surname>
              </persName>
              <idno type="halauthorid">2155597-0</idno>
              <affiliation ref="#struct-1083144"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Abdelmalik</forename>
                <surname>Taleb-Ahmed</surname>
              </persName>
              <email type="md5">dfcbc4eb20dd52fb86ed41046c6cea13</email>
              <email type="domain">uphf.fr</email>
              <idno type="idhal" notation="string">abdelmalik-taleb-ahmed</idno>
              <idno type="idhal" notation="numeric">747913</idno>
              <idno type="halauthorid" notation="string">12094-747913</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-7218-3799</idno>
              <idno type="VIAF">https://viaf.org/viaf/208055269</idno>
              <idno type="ISNI">http://isni.org/isni/0000000431908492</idno>
              <idno type="IDREF">https://www.idref.fr/061058122</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-8750-1905</idno>
              <orgName ref="#struct-1001263"/>
              <affiliation ref="#struct-1303"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Julie</forename>
                <surname>Cagniard</surname>
              </persName>
              <email type="md5">1dce28e8d881110b28c59f67e22e9de1</email>
              <email type="domain">uphf.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2022-05-24 09:27:17</date>
              <date type="whenModified">2024-09-05 13:20:04</date>
              <date type="whenReleased">2022-05-24 10:02:25</date>
              <date type="whenProduced">2018-12-15</date>
              <date type="whenEndEmbargoed">2022-05-24</date>
              <ref type="file" target="https://uphf.hal.science/hal-03428160v1/document">
                <date notBefore="2022-05-24"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://uphf.hal.science/hal-03428160v1/file/1-s2.0-S1110016818300619-main.pdf" id="file-3676510-3209720">
                <date notBefore="2022-05-24"/>
              </ref>
              <ref type="externalLink" target="https://doi.org/10.1016/j.aej.2017.09.016"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="537167">
                <persName>
                  <forename>Julie</forename>
                  <surname>Cagniard</surname>
                </persName>
                <email type="md5">1dce28e8d881110b28c59f67e22e9de1</email>
                <email type="domain">uphf.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-03428160</idno>
            <idno type="halUri">https://uphf.hal.science/hal-03428160</idno>
            <idno type="halBibtex">mostari:hal-03428160</idno>
            <idno type="halRefHtml">&lt;i&gt;Alexandria Engineering Journal&lt;/i&gt;, 2018, 57 (4), pp.2633-2639. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.aej.2017.09.016"&gt;&amp;#x27E8;10.1016/j.aej.2017.09.016&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Alexandria Engineering Journal, 2018, 57 (4), pp.2633-2639. &amp;#x27E8;10.1016/j.aej.2017.09.016&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://creativecommons.org/licenses/by-nc-nd/4.0/">CC BY-NC-ND 4.0 - Attribution - Non-commercial use - No Derivative Works<ref corresp="#file-3676510-3209720"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-VALENCIENNES">Université de Valenciennes et du Hainaut-Cambresis</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="LAMIH" corresp="UNIV-VALENCIENNES">Laboratoire d’Automatique, de Mécanique et d’Informatique Industrielles et Humaines</idno>
            <idno type="stamp" n="INSA-HAUTS-DE-FRANCE" corresp="UNIV-VALENCIENNES">INSA Institut National des Sciences Appliquées Hauts-de-France</idno>
            <idno type="stamp" n="TEST-UPHF">TEST-UPHF</idno>
          </seriesStmt>
          <notesStmt>
            <note type="commentary">IF=3.696</note>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">High performance short-block binary regular LDPC codes</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Latifa</forename>
                    <surname>Mostari</surname>
                  </persName>
                  <idno type="halauthorid">2155597-0</idno>
                  <affiliation ref="#struct-1083144"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Abdelmalik</forename>
                    <surname>Taleb-Ahmed</surname>
                  </persName>
                  <email type="md5">dfcbc4eb20dd52fb86ed41046c6cea13</email>
                  <email type="domain">uphf.fr</email>
                  <idno type="idhal" notation="string">abdelmalik-taleb-ahmed</idno>
                  <idno type="idhal" notation="numeric">747913</idno>
                  <idno type="halauthorid" notation="string">12094-747913</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-7218-3799</idno>
                  <idno type="VIAF">https://viaf.org/viaf/208055269</idno>
                  <idno type="ISNI">http://isni.org/isni/0000000431908492</idno>
                  <idno type="IDREF">https://www.idref.fr/061058122</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-8750-1905</idno>
                  <orgName ref="#struct-1001263"/>
                  <affiliation ref="#struct-1303"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">119690</idno>
                <idno type="issn">1110-0168</idno>
                <title level="j">Alexandria Engineering Journal</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">57</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">2633-2639</biblScope>
                  <date type="datePub">2018-12-15</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.aej.2017.09.016</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Min-sum algorithm</term>
                <term xml:lang="en">Sum-product algorithm</term>
                <term xml:lang="en">Iterative decoding</term>
                <term xml:lang="en">Parallel concatenation</term>
                <term xml:lang="en">LDPC code</term>
              </keywords>
              <classCode scheme="halDomain" n="spi.auto">Engineering Sciences [physics]/Automatic</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>LDPC code shows a good performance with long-block codes. However, certain channels are constrained to use short-block codes due to latency. Therefore, concatenated LDPC codes with iterative decoding is a good choice to get a good performance. Concatenated binary LDPC codes were introduced as a class of concatenated codes in which the LDPC codes are irregular codes having different parameters. Although irregular LDPC codes are more efficient than regular codes, irregular LDPC codes have an error floor and a higher encoding complexity than regular code. In this paper, in order to get a good performance/complexity trade-off with a short-block code, we investigate a parallel concatenation of two identical regular binary LDPC codes, using an interleaver. Simulation results show that the proposed code outperforms a single LDPC code. The proposed code needs less time decoding delay than a single LDPC code with the same iteration number. Also, the proposed code needs a less number of iterations to achieve the same performance of a single LDPC code that leads to less decoding complexity and decoding delay. A simplified algorithm, the min-sum algorithm, that is used to decode the component codes shows a small performance loss with respect to the sum-product algorithm.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="institution" xml:id="struct-1083144" status="VALID">
          <idno type="ROR">https://ror.org/04yymzm67</idno>
          <orgName>Université Hassiba Benbouali of Chlef = Hassiba Benbouali University of Chlef</orgName>
          <desc>
            <address>
              <country key="DZ"/>
            </address>
            <ref type="url">https://www.univ-chlef.dz/uc/</ref>
          </desc>
        </org>
        <org type="laboratory" xml:id="struct-1303" status="OLD">
          <idno type="IdRef">050705253</idno>
          <idno type="ISNI">0000000122013679</idno>
          <idno type="RNSR">201220427F</idno>
          <idno type="ROR">https://ror.org/006z7v557</idno>
          <orgName>Laboratoire d'Automatique, de Mécanique et d'Informatique industrielles et Humaines - UMR 8201</orgName>
          <orgName type="acronym">LAMIH</orgName>
          <date type="start">1994-01-01</date>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LE MONT HOUY 59313 VALENCIENNES CEDEX 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.uphf.fr/LAMIH/fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300279" type="direct"/>
            <relation name="UMR8201" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300279" status="OLD">
          <idno type="IdRef">026404079</idno>
          <idno type="ISNI">0000000107901416</idno>
          <idno type="ROR">https://ror.org/02ezch769</idno>
          <orgName>Université de Valenciennes et du Hainaut-Cambrésis</orgName>
          <orgName type="acronym">UVHC</orgName>
          <date type="start">1979-01-01</date>
          <date type="end">2019-09-08</date>
          <desc>
            <address>
              <addrLine>Campus Mont Houy59313 Valenciennes Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.uphf.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>