Protograph-Based Raptor-Like LDPC Codes

This paper proposes protograph-based Raptor-like (PBRL) codes as a class of rate-compatible low-density parity-check codes for binary-input AWGN channels. As with the Raptor codes, exclusive-OR operations on precoded bits produce additional parity bits providing extensive rate compatibility. Unlike...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on communications 2015-05, Vol.63 (5), p.1522-1532
Hauptverfasser: Chen, Tsung-Yi, Vakilinia, Kasra, Divsalar, Dariush, Wesel, Richard D.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1532
container_issue 5
container_start_page 1522
container_title IEEE transactions on communications
container_volume 63
creator Chen, Tsung-Yi
Vakilinia, Kasra
Divsalar, Dariush
Wesel, Richard D.
description This paper proposes protograph-based Raptor-like (PBRL) codes as a class of rate-compatible low-density parity-check codes for binary-input AWGN channels. As with the Raptor codes, exclusive-OR operations on precoded bits produce additional parity bits providing extensive rate compatibility. Unlike Raptor codes, each additional parity bit in the protograph is explicitly designed to optimize the density evolution threshold. During the lifting process, approximate cycle extrinsic message degree (ACE) and circulant progressive edge growth (CPEG) constraints are used to avoid undesirable graphical structures. Some density-evolution performance is sacrificed to obtain lower error floors, particularly at short block-lengths. Simulation results are shown for information block sizes of k = 1032 and 16 384. For a target frame error rate of 10 -5 , at each rate, the k = 1032 and 16 384 code families perform within 1 dB and 0.4 dB of both the Gallager bound and the normal approximation, respectively. The 16 384 code family outperforms the best known standardized code family, namely, the AR4JA codes. The PBRL codes also outperform DVB-S2 codes that have the advantages of longer blocklengths and outer BCH codes. Performance is similar to RC code families designed by Nguyen et al. that do not constrain codes to have the PBRL structure and involve simulation in the optimization process at each rate.
doi_str_mv 10.1109/TCOMM.2015.2404842
format Article
fullrecord <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TCOMM_2015_2404842</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7045568</ieee_id><sourcerecordid>10_1109_TCOMM_2015_2404842</sourcerecordid><originalsourceid>FETCH-LOGICAL-c311t-fe1df35877eac0254b0e183723629872b8f822ece61e9c89ae4acff0b37315853</originalsourceid><addsrcrecordid>eNo9zztPwzAUhmELgUQo_AFYsjE5nONL7IwQrlKqVqjMkeMcQ7gokZ2Ffw-lFdM3vZ_0MHaOUCBCdbWpV8tlIQB1IRQoq8QBy1Bry8Fqc8gygAp4aYw9ZicpvQOAAikzdrmO4zy-Rje98RuXqM-f3TSPkTfDB-XN7brO67GndMqOgvtMdLbfBXu5v9vUj7xZPTzV1w33EnHmgbAPUltjyHkQWnVAaKURshSVNaKzwQpBnkqkytvKkXI-BOikkaitlgsmdr8-jilFCu0Uhy8Xv1uEdktt_6jtltruqb_RxS4aiOg_MKC0Lq38AVuHTfc</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Protograph-Based Raptor-Like LDPC Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Chen, Tsung-Yi ; Vakilinia, Kasra ; Divsalar, Dariush ; Wesel, Richard D.</creator><creatorcontrib>Chen, Tsung-Yi ; Vakilinia, Kasra ; Divsalar, Dariush ; Wesel, Richard D.</creatorcontrib><description>This paper proposes protograph-based Raptor-like (PBRL) codes as a class of rate-compatible low-density parity-check codes for binary-input AWGN channels. As with the Raptor codes, exclusive-OR operations on precoded bits produce additional parity bits providing extensive rate compatibility. Unlike Raptor codes, each additional parity bit in the protograph is explicitly designed to optimize the density evolution threshold. During the lifting process, approximate cycle extrinsic message degree (ACE) and circulant progressive edge growth (CPEG) constraints are used to avoid undesirable graphical structures. Some density-evolution performance is sacrificed to obtain lower error floors, particularly at short block-lengths. Simulation results are shown for information block sizes of k = 1032 and 16 384. For a target frame error rate of 10 -5 , at each rate, the k = 1032 and 16 384 code families perform within 1 dB and 0.4 dB of both the Gallager bound and the normal approximation, respectively. The 16 384 code family outperforms the best known standardized code family, namely, the AR4JA codes. The PBRL codes also outperform DVB-S2 codes that have the advantages of longer blocklengths and outer BCH codes. Performance is similar to RC code families designed by Nguyen et al. that do not constrain codes to have the PBRL structure and involve simulation in the optimization process at each rate.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2015.2404842</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>IEEE</publisher><subject>Approximation methods ; Channel coding ; Decoding ; Encoding ; Iterative decoding ; Low-Density Parity-Check Codes ; Optimization ; Signal to noise ratio</subject><ispartof>IEEE transactions on communications, 2015-05, Vol.63 (5), p.1522-1532</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c311t-fe1df35877eac0254b0e183723629872b8f822ece61e9c89ae4acff0b37315853</citedby><cites>FETCH-LOGICAL-c311t-fe1df35877eac0254b0e183723629872b8f822ece61e9c89ae4acff0b37315853</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7045568$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7045568$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Chen, Tsung-Yi</creatorcontrib><creatorcontrib>Vakilinia, Kasra</creatorcontrib><creatorcontrib>Divsalar, Dariush</creatorcontrib><creatorcontrib>Wesel, Richard D.</creatorcontrib><title>Protograph-Based Raptor-Like LDPC Codes</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>This paper proposes protograph-based Raptor-like (PBRL) codes as a class of rate-compatible low-density parity-check codes for binary-input AWGN channels. As with the Raptor codes, exclusive-OR operations on precoded bits produce additional parity bits providing extensive rate compatibility. Unlike Raptor codes, each additional parity bit in the protograph is explicitly designed to optimize the density evolution threshold. During the lifting process, approximate cycle extrinsic message degree (ACE) and circulant progressive edge growth (CPEG) constraints are used to avoid undesirable graphical structures. Some density-evolution performance is sacrificed to obtain lower error floors, particularly at short block-lengths. Simulation results are shown for information block sizes of k = 1032 and 16 384. For a target frame error rate of 10 -5 , at each rate, the k = 1032 and 16 384 code families perform within 1 dB and 0.4 dB of both the Gallager bound and the normal approximation, respectively. The 16 384 code family outperforms the best known standardized code family, namely, the AR4JA codes. The PBRL codes also outperform DVB-S2 codes that have the advantages of longer blocklengths and outer BCH codes. Performance is similar to RC code families designed by Nguyen et al. that do not constrain codes to have the PBRL structure and involve simulation in the optimization process at each rate.</description><subject>Approximation methods</subject><subject>Channel coding</subject><subject>Decoding</subject><subject>Encoding</subject><subject>Iterative decoding</subject><subject>Low-Density Parity-Check Codes</subject><subject>Optimization</subject><subject>Signal to noise ratio</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9zztPwzAUhmELgUQo_AFYsjE5nONL7IwQrlKqVqjMkeMcQ7gokZ2Ffw-lFdM3vZ_0MHaOUCBCdbWpV8tlIQB1IRQoq8QBy1Bry8Fqc8gygAp4aYw9ZicpvQOAAikzdrmO4zy-Rje98RuXqM-f3TSPkTfDB-XN7brO67GndMqOgvtMdLbfBXu5v9vUj7xZPTzV1w33EnHmgbAPUltjyHkQWnVAaKURshSVNaKzwQpBnkqkytvKkXI-BOikkaitlgsmdr8-jilFCu0Uhy8Xv1uEdktt_6jtltruqb_RxS4aiOg_MKC0Lq38AVuHTfc</recordid><startdate>201505</startdate><enddate>201505</enddate><creator>Chen, Tsung-Yi</creator><creator>Vakilinia, Kasra</creator><creator>Divsalar, Dariush</creator><creator>Wesel, Richard D.</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>201505</creationdate><title>Protograph-Based Raptor-Like LDPC Codes</title><author>Chen, Tsung-Yi ; Vakilinia, Kasra ; Divsalar, Dariush ; Wesel, Richard D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c311t-fe1df35877eac0254b0e183723629872b8f822ece61e9c89ae4acff0b37315853</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Approximation methods</topic><topic>Channel coding</topic><topic>Decoding</topic><topic>Encoding</topic><topic>Iterative decoding</topic><topic>Low-Density Parity-Check Codes</topic><topic>Optimization</topic><topic>Signal to noise ratio</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Chen, Tsung-Yi</creatorcontrib><creatorcontrib>Vakilinia, Kasra</creatorcontrib><creatorcontrib>Divsalar, Dariush</creatorcontrib><creatorcontrib>Wesel, Richard D.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Chen, Tsung-Yi</au><au>Vakilinia, Kasra</au><au>Divsalar, Dariush</au><au>Wesel, Richard D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Protograph-Based Raptor-Like LDPC Codes</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2015-05</date><risdate>2015</risdate><volume>63</volume><issue>5</issue><spage>1522</spage><epage>1532</epage><pages>1522-1532</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>This paper proposes protograph-based Raptor-like (PBRL) codes as a class of rate-compatible low-density parity-check codes for binary-input AWGN channels. As with the Raptor codes, exclusive-OR operations on precoded bits produce additional parity bits providing extensive rate compatibility. Unlike Raptor codes, each additional parity bit in the protograph is explicitly designed to optimize the density evolution threshold. During the lifting process, approximate cycle extrinsic message degree (ACE) and circulant progressive edge growth (CPEG) constraints are used to avoid undesirable graphical structures. Some density-evolution performance is sacrificed to obtain lower error floors, particularly at short block-lengths. Simulation results are shown for information block sizes of k = 1032 and 16 384. For a target frame error rate of 10 -5 , at each rate, the k = 1032 and 16 384 code families perform within 1 dB and 0.4 dB of both the Gallager bound and the normal approximation, respectively. The 16 384 code family outperforms the best known standardized code family, namely, the AR4JA codes. The PBRL codes also outperform DVB-S2 codes that have the advantages of longer blocklengths and outer BCH codes. Performance is similar to RC code families designed by Nguyen et al. that do not constrain codes to have the PBRL structure and involve simulation in the optimization process at each rate.</abstract><pub>IEEE</pub><doi>10.1109/TCOMM.2015.2404842</doi><tpages>11</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0090-6778
ispartof IEEE transactions on communications, 2015-05, Vol.63 (5), p.1522-1532
issn 0090-6778
1558-0857
language eng
recordid cdi_crossref_primary_10_1109_TCOMM_2015_2404842
source IEEE Electronic Library (IEL)
subjects Approximation methods
Channel coding
Decoding
Encoding
Iterative decoding
Low-Density Parity-Check Codes
Optimization
Signal to noise ratio
title Protograph-Based Raptor-Like LDPC Codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T07%3A27%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Protograph-Based%20Raptor-Like%20LDPC%20Codes&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Chen,%20Tsung-Yi&rft.date=2015-05&rft.volume=63&rft.issue=5&rft.spage=1522&rft.epage=1532&rft.pages=1522-1532&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2015.2404842&rft_dat=%3Ccrossref_RIE%3E10_1109_TCOMM_2015_2404842%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=7045568&rfr_iscdi=true