An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes
Error-floors are the main reason for excluding LDPC codes from applications requiring very low bit-error rate. They are attributed to a particular structure in the codes' Tanner graphs, known as trapping sets, which traps the message-passing algorithms commonly used to decode LDPC codes, and pr...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 2011-01, Vol.59 (1), p.64-73 |
|---|---|
| Hauptverfasser: | , , , |
| 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 | 73 |
|---|---|
| container_issue | 1 |
| container_start_page | 64 |
| container_title | IEEE transactions on communications |
| container_volume | 59 |
| creator | Kang, Jingyu Huang, Qin Lin, Shu Abdel-Ghaffar, Khaled |
| description | Error-floors are the main reason for excluding LDPC codes from applications requiring very low bit-error rate. They are attributed to a particular structure in the codes' Tanner graphs, known as trapping sets, which traps the message-passing algorithms commonly used to decode LDPC codes, and prevents decoding from converging to the correct codeword. A technique is proposed to break trapping sets while decoding. Based on decoding results leading to a decoding failure, some bits are identified in a previous iteration and flipped and decoding is restarted. This backtracking may enable the decoder to get out of the trapped state. A semi-analytical method is also proposed to predict the error-floor after backtracking. Simulation results indicate the effectiveness of the proposed technique in lowering the error-floor. The technique, which has moderate complexity overhead, is applicable to any code without requiring a prior knowledge of the structure of its trapping sets. |
| doi_str_mv | 10.1109/TCOMM.2010.101210.090628 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_5605921</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5605921</ieee_id><sourcerecordid>1671225862</sourcerecordid><originalsourceid>FETCH-LOGICAL-c369t-e20c069190a5cded7bb407c25044adfacd6a2caa4cc9267d25012b452f0932ec3</originalsourceid><addsrcrecordid>eNpdkE9LxDAQxYMouP75BF6CIHipTtImbY5r11VhRQ968BSy6VSr3UaTruK3N7WyBy8zzLzfPIZHCGVwxhio84fy7vb2jMMwA-OxgQLJiy0yYUIUCRQi3yYTiNtE5nmxS_ZCeAWADNJ0Qp6mHb3p0Zu--UQ6Q-uqpnum0_bZ-aZ_WdGvWOmFsW-9j2XQekcX7gs97V-QXnrvfDJvnfOBupouZvclLV2F4YDs1KYNePjX98nj_PKhvE4Wd1c35XSR2FSqPkEOFqRiCoywFVb5cplBbrmALDNVbWwlDbfGZNYqLvMqCowvM8FrUClHm-6T09H33buPNYZer5pgsW1Nh24dNJM541wUkkf0-B_66ta-i9_pIpPRXgFEqBgh610IHmv97puV8d-agR4i17-R6yFyPUaux8jj6cmfvwnWtLU3nW3C5p6nuUxVMXBHI9cg4kYWEoTiLP0BS76JQA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>846926900</pqid></control><display><type>article</type><title>An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Kang, Jingyu ; Huang, Qin ; Lin, Shu ; Abdel-Ghaffar, Khaled</creator><creatorcontrib>Kang, Jingyu ; Huang, Qin ; Lin, Shu ; Abdel-Ghaffar, Khaled</creatorcontrib><description>Error-floors are the main reason for excluding LDPC codes from applications requiring very low bit-error rate. They are attributed to a particular structure in the codes' Tanner graphs, known as trapping sets, which traps the message-passing algorithms commonly used to decode LDPC codes, and prevents decoding from converging to the correct codeword. A technique is proposed to break trapping sets while decoding. Based on decoding results leading to a decoding failure, some bits are identified in a previous iteration and flipped and decoding is restarted. This backtracking may enable the decoder to get out of the trapped state. A semi-analytical method is also proposed to predict the error-floor after backtracking. Simulation results indicate the effectiveness of the proposed technique in lowering the error-floor. The technique, which has moderate complexity overhead, is applicable to any code without requiring a prior knowledge of the structure of its trapping sets.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2010.101210.090628</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York, NY: IEEE</publisher><subject>Algorithms ; Applied sciences ; AWGN ; backtracking ; Breaking ; Charge carrier processes ; Codes ; Coding, codes ; Computer simulation ; Decoders ; Decoding ; error-floor ; Exact sciences and technology ; Failure ; Graphs ; Information, signal and communications theory ; Iterative decoding ; LDPC code ; Low density parity check codes ; Maximum likelihood decoding ; message-passing algorithm ; Signal and communications theory ; Signal to noise ratio ; Telecommunications and information theory ; Trapping ; trapping set</subject><ispartof>IEEE transactions on communications, 2011-01, Vol.59 (1), p.64-73</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c369t-e20c069190a5cded7bb407c25044adfacd6a2caa4cc9267d25012b452f0932ec3</citedby><cites>FETCH-LOGICAL-c369t-e20c069190a5cded7bb407c25044adfacd6a2caa4cc9267d25012b452f0932ec3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5605921$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,4024,27923,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5605921$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=23763988$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Kang, Jingyu</creatorcontrib><creatorcontrib>Huang, Qin</creatorcontrib><creatorcontrib>Lin, Shu</creatorcontrib><creatorcontrib>Abdel-Ghaffar, Khaled</creatorcontrib><title>An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>Error-floors are the main reason for excluding LDPC codes from applications requiring very low bit-error rate. They are attributed to a particular structure in the codes' Tanner graphs, known as trapping sets, which traps the message-passing algorithms commonly used to decode LDPC codes, and prevents decoding from converging to the correct codeword. A technique is proposed to break trapping sets while decoding. Based on decoding results leading to a decoding failure, some bits are identified in a previous iteration and flipped and decoding is restarted. This backtracking may enable the decoder to get out of the trapped state. A semi-analytical method is also proposed to predict the error-floor after backtracking. Simulation results indicate the effectiveness of the proposed technique in lowering the error-floor. The technique, which has moderate complexity overhead, is applicable to any code without requiring a prior knowledge of the structure of its trapping sets.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>AWGN</subject><subject>backtracking</subject><subject>Breaking</subject><subject>Charge carrier processes</subject><subject>Codes</subject><subject>Coding, codes</subject><subject>Computer simulation</subject><subject>Decoders</subject><subject>Decoding</subject><subject>error-floor</subject><subject>Exact sciences and technology</subject><subject>Failure</subject><subject>Graphs</subject><subject>Information, signal and communications theory</subject><subject>Iterative decoding</subject><subject>LDPC code</subject><subject>Low density parity check codes</subject><subject>Maximum likelihood decoding</subject><subject>message-passing algorithm</subject><subject>Signal and communications theory</subject><subject>Signal to noise ratio</subject><subject>Telecommunications and information theory</subject><subject>Trapping</subject><subject>trapping set</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkE9LxDAQxYMouP75BF6CIHipTtImbY5r11VhRQ968BSy6VSr3UaTruK3N7WyBy8zzLzfPIZHCGVwxhio84fy7vb2jMMwA-OxgQLJiy0yYUIUCRQi3yYTiNtE5nmxS_ZCeAWADNJ0Qp6mHb3p0Zu--UQ6Q-uqpnum0_bZ-aZ_WdGvWOmFsW-9j2XQekcX7gs97V-QXnrvfDJvnfOBupouZvclLV2F4YDs1KYNePjX98nj_PKhvE4Wd1c35XSR2FSqPkEOFqRiCoywFVb5cplBbrmALDNVbWwlDbfGZNYqLvMqCowvM8FrUClHm-6T09H33buPNYZer5pgsW1Nh24dNJM541wUkkf0-B_66ta-i9_pIpPRXgFEqBgh610IHmv97puV8d-agR4i17-R6yFyPUaux8jj6cmfvwnWtLU3nW3C5p6nuUxVMXBHI9cg4kYWEoTiLP0BS76JQA</recordid><startdate>201101</startdate><enddate>201101</enddate><creator>Kang, Jingyu</creator><creator>Huang, Qin</creator><creator>Lin, Shu</creator><creator>Abdel-Ghaffar, Khaled</creator><general>IEEE</general><general>Institute of Electrical and Electronics Engineers</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>201101</creationdate><title>An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes</title><author>Kang, Jingyu ; Huang, Qin ; Lin, Shu ; Abdel-Ghaffar, Khaled</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c369t-e20c069190a5cded7bb407c25044adfacd6a2caa4cc9267d25012b452f0932ec3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>AWGN</topic><topic>backtracking</topic><topic>Breaking</topic><topic>Charge carrier processes</topic><topic>Codes</topic><topic>Coding, codes</topic><topic>Computer simulation</topic><topic>Decoders</topic><topic>Decoding</topic><topic>error-floor</topic><topic>Exact sciences and technology</topic><topic>Failure</topic><topic>Graphs</topic><topic>Information, signal and communications theory</topic><topic>Iterative decoding</topic><topic>LDPC code</topic><topic>Low density parity check codes</topic><topic>Maximum likelihood decoding</topic><topic>message-passing algorithm</topic><topic>Signal and communications theory</topic><topic>Signal to noise ratio</topic><topic>Telecommunications and information theory</topic><topic>Trapping</topic><topic>trapping set</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kang, Jingyu</creatorcontrib><creatorcontrib>Huang, Qin</creatorcontrib><creatorcontrib>Lin, Shu</creatorcontrib><creatorcontrib>Abdel-Ghaffar, Khaled</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>Pascal-Francis</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology & Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kang, Jingyu</au><au>Huang, Qin</au><au>Lin, Shu</au><au>Abdel-Ghaffar, Khaled</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2011-01</date><risdate>2011</risdate><volume>59</volume><issue>1</issue><spage>64</spage><epage>73</epage><pages>64-73</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>Error-floors are the main reason for excluding LDPC codes from applications requiring very low bit-error rate. They are attributed to a particular structure in the codes' Tanner graphs, known as trapping sets, which traps the message-passing algorithms commonly used to decode LDPC codes, and prevents decoding from converging to the correct codeword. A technique is proposed to break trapping sets while decoding. Based on decoding results leading to a decoding failure, some bits are identified in a previous iteration and flipped and decoding is restarted. This backtracking may enable the decoder to get out of the trapped state. A semi-analytical method is also proposed to predict the error-floor after backtracking. Simulation results indicate the effectiveness of the proposed technique in lowering the error-floor. The technique, which has moderate complexity overhead, is applicable to any code without requiring a prior knowledge of the structure of its trapping sets.</abstract><cop>New York, NY</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2010.101210.090628</doi><tpages>10</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 2011-01, Vol.59 (1), p.64-73 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_ieee_primary_5605921 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Applied sciences AWGN backtracking Breaking Charge carrier processes Codes Coding, codes Computer simulation Decoders Decoding error-floor Exact sciences and technology Failure Graphs Information, signal and communications theory Iterative decoding LDPC code Low density parity check codes Maximum likelihood decoding message-passing algorithm Signal and communications theory Signal to noise ratio Telecommunications and information theory Trapping trapping set |
| title | An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of 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-21T14%3A31%3A29IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20Iterative%20Decoding%20Algorithm%20with%20Backtracking%20to%20Lower%20the%20Error-Floors%20of%20LDPC%20Codes&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Kang,%20Jingyu&rft.date=2011-01&rft.volume=59&rft.issue=1&rft.spage=64&rft.epage=73&rft.pages=64-73&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2010.101210.090628&rft_dat=%3Cproquest_RIE%3E1671225862%3C/proquest_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=846926900&rft_id=info:pmid/&rft_ieee_id=5605921&rfr_iscdi=true |