<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232019000200117</article-id>
<article-id pub-id-type="doi">10.22201/icat.16656423.2019.17.2.802</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Comparative study on performance of the LDPC codes and turbo-codes used in the image transmission in the gaussian and rayleigh channel]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Menezla]]></surname>
<given-names><![CDATA[Fayssal]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Meliani]]></surname>
<given-names><![CDATA[Rachida]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mahdjoub]]></surname>
<given-names><![CDATA[Zoubir]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,University of Djillali Liabès Communication Networks, Architecture and Multimedia, Laboratory ]]></institution>
<addr-line><![CDATA[Sidi Bel-Abbès ]]></addr-line>
<country>Algeria</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>04</month>
<year>2019</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>04</month>
<year>2019</year>
</pub-date>
<volume>17</volume>
<numero>2</numero>
<fpage>117</fpage>
<lpage>125</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232019000200117&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232019000200117&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232019000200117&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract The errors induced by channel noise influence on the quality of digital transmission. The latter depends on the probability of errors in the transmitted symbols. To control these errors, a technique of digital signal processing is used, including the information code to be transmitted. As these techniques are used for controlling the transmission, they are called "channel encoding". In this paper, we introduced and studied two major correction code families' error; LDPC (Low Density Parity Check) and the turbo code. We used our simulation model to evaluate the performance of a Gaussian channel. The results show the effect of iterative LDPC and Turbo code on the transmission and quality of information. Our numerical simulation has shown that the resulting image was corrected gradually as the number of iterations increases for both channels. On the Rayleigh channel, the image correction is obtained for a higher number of iterations over the Gaussian channel.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[LDPC code]]></kwd>
<kwd lng="en"><![CDATA[turbo-codes]]></kwd>
<kwd lng="en"><![CDATA[puncturing]]></kwd>
<kwd lng="en"><![CDATA[Gaussian and Rayleigh channel]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Almaamory]]></surname>
<given-names><![CDATA[A. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Mohammed]]></surname>
<given-names><![CDATA[H. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Performance evaluation and comparison between LDPC and Turbo coded MC-CDMA]]></article-title>
<source><![CDATA[Journal of Engineering]]></source>
<year>2012</year>
<volume>18</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>433-43</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bassou]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Performances des turbo-codes associés a une modulation a grand nombre d'état sur canal de Rayleigh sans mémoire]]></source>
<year>2000</year>
<publisher-name><![CDATA[University Djillali Liabes Sidi bel Abbes]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Benedetto]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Montorsi]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Iterative decoding of serially concatenated convolutional codes]]></article-title>
<source><![CDATA[Electronics letters]]></source>
<year>1996</year>
<volume>32</volume>
<numero>13</numero>
<issue>13</issue>
<page-range>1186-8</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Berrou]]></surname>
<given-names><![CDATA[G]]></given-names>
</name>
<name>
<surname><![CDATA[Glavieux]]></surname>
<given-names><![CDATA[&#913;.]]></given-names>
</name>
<name>
<surname><![CDATA[Thitimajshima]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1]]></article-title>
<source><![CDATA[Proceedings of ICC'93-IEEE International Conference on Communications]]></source>
<year>1993</year>
<page-range>1064-70</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gaffour]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[L'effet du poinçonnage dans les turbo-codes]]></source>
<year>2005</year>
<publisher-name><![CDATA[University Djillali Liabes Sidi bel Abbes]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gallager]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Low-density parity-check codes]]></article-title>
<source><![CDATA[IRE Transactions on information theory]]></source>
<year>1962</year>
<volume>8</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>21-8</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hoeher]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[New iterative (turbo) decoding algorithms]]></article-title>
<source><![CDATA[International Symposium on Turbo Codes]]></source>
<year>1997</year>
<page-range>63-70</page-range><publisher-loc><![CDATA[Brest ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kou]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Fossorier]]></surname>
<given-names><![CDATA[M. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Low-density parity-check codes based on finite geometries: a rediscovery and new results]]></article-title>
<source><![CDATA[IEEE Transactions on Information theory]]></source>
<year>2001</year>
<volume>47</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2711-36</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[MacKay]]></surname>
<given-names><![CDATA[D.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Neal]]></surname>
<given-names><![CDATA[R. M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Near Shannon limit performance of low-density parity-check codes]]></article-title>
<source><![CDATA[ElectronicsLetters]]></source>
<year>1997</year>
<volume>33</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>457-8</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Menezla]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Etude et évaluation d'un turbo-code dans son approche pragmatique]]></source>
<year>2010</year>
<publisher-name><![CDATA[University Djillali Liabes Sidi bel Abbes]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Menezla]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Meliani]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahdjoub]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[The performances of a turbo-code and this pragmatic approach]]></source>
<year>2012</year>
<conf-name><![CDATA[ 6International Conference on Sciences of Electronics, Technologies of Information and Telecommunications (SETIT)]]></conf-name>
<conf-date>2012</conf-date>
<conf-loc> </conf-loc>
<page-range>680-4</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Menezla]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Méliani]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahdjoub]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
</person-group>
<source><![CDATA[L'augmentation du rendement d'un turbo-code dans son approche pragmatique]]></source>
<year>2011</year>
<conf-name><![CDATA[ CGE, 07]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mostari]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Bekkar]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<source><![CDATA[L'effet de l'entrelacement sur les codes en cascades. engineering]]></source>
<year>2000</year>
<publisher-loc><![CDATA[Sidi Bel Abbes ]]></publisher-loc>
<publisher-name><![CDATA[University Djillali Liabes]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mostari]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Etude de la fonction d'adaptation sur la réalisation des turbo-codes]]></source>
<year>2008</year>
<publisher-loc><![CDATA[Sidi bel Abbes ]]></publisher-loc>
<publisher-name><![CDATA[University Djillali Liabes]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Mostari]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Méliani]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Bounoua]]></surname>
<given-names><![CDATA[&#913;.]]></given-names>
</name>
</person-group>
<source><![CDATA[Turbo-code in a bit inter leaved tubo-coded modulation system]]></source>
<year>2010</year>
<conf-name><![CDATA[ CMT]]></conf-name>
<conf-date>2010</conf-date>
<conf-loc>Morocco </conf-loc>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Paolini]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Iterative decoding methods based on low-density graphs]]></source>
<year>2007</year>
<publisher-name><![CDATA[Universitadeglistudi di Bologna]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Peterson]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Encoding and error-correction procedures for the Bose-Chaudhuri codes]]></article-title>
<source><![CDATA[IRE Transactions on information theory]]></source>
<year>1960</year>
<volume>6</volume>
<numero>A</numero>
<issue>A</issue>
<page-range>459-70</page-range></nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Richardson]]></surname>
<given-names><![CDATA[T. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Shokrollahi]]></surname>
<given-names><![CDATA[&#924;. &#913;.]]></given-names>
</name>
<name>
<surname><![CDATA[Urbanke]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Design of capacity-approaching irregular low-density parity-check codes]]></article-title>
<source><![CDATA[IEEE transactions on information theory]]></source>
<year>2001</year>
<volume>47</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>619-37</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sassatelli]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Declercq]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Non-binary hybrid LDPC codes: Structure, decoding and optimization]]></source>
<year>2006</year>
<conf-name><![CDATA[ IEEE Information Theory Workshop-ITW, 06]]></conf-name>
<conf-date>2006</conf-date>
<conf-loc>Chengdu </conf-loc>
</nlm-citation>
</ref>
<ref id="B20">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Shannon]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[A mathematical theory of communication, bell System technical Journal 27: 379-423 and 623-656]]></source>
<year>1948</year>
<publisher-name><![CDATA[Mathematical Reviews (MathSciNet): MR10]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B21">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sipser]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Spielman]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Expander codes]]></source>
<year>1994</year>
<conf-name><![CDATA[ 35Annual Symposium on Foundations of Computer Science]]></conf-name>
<conf-loc> </conf-loc>
<page-range>566-76</page-range><publisher-name><![CDATA[IEEE]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B22">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tanner]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A recursive approach to low complexity codes]]></article-title>
<source><![CDATA[IEEE transactions on information theory]]></source>
<year>1981</year>
<volume>27</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>533-47</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
