Dergi makalesi Açık Erişim
Mitchell, David G. M.; Lentmaier, Michael; Pusane, Ali E.; Costello, Daniel J., Jr.
<?xml version='1.0' encoding='UTF-8'?> <record xmlns="http://www.loc.gov/MARC21/slim"> <leader>00000nam##2200000uu#4500</leader> <datafield tag="260" ind1=" " ind2=" "> <subfield code="c">2016-01-01</subfield> </datafield> <datafield tag="100" ind1=" " ind2=" "> <subfield code="a">Mitchell, David G. M.</subfield> </datafield> <datafield tag="540" ind1=" " ind2=" "> <subfield code="u">http://www.opendefinition.org/licenses/cc-by</subfield> <subfield code="a">Creative Commons Attribution</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">Lund Univ, Dept Elect & Informat Technol, Lund, Sweden</subfield> <subfield code="a">Lentmaier, Michael</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">Bogazici Univ, Dept Elect & Elect Engn, Istanbul, Turkey</subfield> <subfield code="a">Pusane, Ali E.</subfield> </datafield> <datafield tag="700" ind1=" " ind2=" "> <subfield code="u">Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA</subfield> <subfield code="a">Costello, Daniel J., Jr.</subfield> </datafield> <datafield tag="909" ind1="C" ind2="O"> <subfield code="o">oai:zenodo.org:60407</subfield> <subfield code="p">user-tubitak-destekli-proje-yayinlari</subfield> </datafield> <datafield tag="542" ind1=" " ind2=" "> <subfield code="l">open</subfield> </datafield> <datafield tag="520" ind1=" " ind2=" "> <subfield code="a">In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and suitability of an LDPC code ensemble for random puncturing is completely determined by a single constant that depends only on the rate and the BP threshold of the mother code ensemble. We then provide an efficient way to accurately predict BP thresholds of randomly punctured LDPC code ensembles on the binary-input additive white Gaussian noise channel (BI-AWGNC), given only the BP threshold of the mother code ensemble on the BEC and the design rate, and we show how the prediction can be improved with knowledge of the BI-AWGNC threshold. We also perform an asymptotic minimum distance analysis of randomly punctured code ensembles and present simulation results that confirm the robust decoding performance promised by the asymptotic results. Protograph-based LDPC block code and spatially coupled LDPC code ensembles are used throughout as examples to demonstrate the results.</subfield> </datafield> <datafield tag="024" ind1=" " ind2=" "> <subfield code="a">10.1109/JSAC.2015.2507758</subfield> <subfield code="2">doi</subfield> </datafield> <controlfield tag="005">20210316005921.0</controlfield> <datafield tag="245" ind1=" " ind2=" "> <subfield code="a">Randomly Punctured LDPC Codes</subfield> </datafield> <datafield tag="909" ind1="C" ind2="4"> <subfield code="n">2</subfield> <subfield code="v">34</subfield> <subfield code="c">408-421</subfield> <subfield code="p">IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS</subfield> </datafield> <datafield tag="650" ind1="1" ind2="7"> <subfield code="2">opendefinition.org</subfield> <subfield code="a">cc-by</subfield> </datafield> <controlfield tag="001">60407</controlfield> <datafield tag="980" ind1=" " ind2=" "> <subfield code="a">user-tubitak-destekli-proje-yayinlari</subfield> </datafield> <datafield tag="980" ind1=" " ind2=" "> <subfield code="b">article</subfield> <subfield code="a">publication</subfield> </datafield> <datafield tag="856" ind1="4" ind2=" "> <subfield code="u">https://aperta.ulakbim.gov.trrecord/60407/files/bib-cf9e5394-fe57-4838-8dda-adededfe613b.txt</subfield> <subfield code="z">md5:70f3313c36c670b8fdc3eeaf5ea80758</subfield> <subfield code="s">159</subfield> </datafield> </record>
Görüntülenme | 38 |
İndirme | 12 |
Veri hacmi | 1.9 kB |
Tekil görüntülenme | 34 |
Tekil indirme | 12 |