Trapping and Absorbing Set Enumerators for Protograph-Based Generalized Low-Density Parity-Check Code Ensembles

Generalized low-density parity-check (GLDPC) codes have outstanding performance outperforming the standard low-density parity-check (LDPC) codes. However, the performance of these codes under iterative decoding can be degraded because of the presence of trapping, absorbing and fully absorbing sets i...

Full description

Saved in:
Bibliographic Details
Main Author: Yacoub, Emna Ben
Format: Conference Proceeding
Language:English
Subjects:
Control systems
Iterative decoding
Redundancy
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 147
container_issue
container_start_page 142
container_title
container_volume
creator Yacoub, Emna Ben
description Generalized low-density parity-check (GLDPC) codes have outstanding performance outperforming the standard low-density parity-check (LDPC) codes. However, the performance of these codes under iterative decoding can be degraded because of the presence of trapping, absorbing and fully absorbing sets in the code Tanner graphs. The (elementary) trapping and (fully) absorbing sets of protograph-based GLDPC codes are studied. The finite-length and asymptotic distributions of (elementary) trapping and (fully) absorbing sets for protograph-based GLDPC code ensembles are derived and evaluated. The asymptotic distributions can be efficiently computed by solving a system of equations. The relative minimum Δ-trapping/(fully) absorbing set size can be directly computed by adding one equation to the system of equations. This is useful for the code design where we can restrict the search to ensembles for which the minimum Δ-trapping and (fully) absorbing set sizes grow linearly with the blocklength. The normalized logarithmic asymptotic distributions of (elementary) trapping and (fully) absorbing sets for an example GLDPC code ensemble are evaluated.
doi_str_mv 10.1109/Redundancy59964.2023.10330177
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_10330177</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>10330177</ieee_id><sourcerecordid>10330177</sourcerecordid><originalsourceid>FETCH-LOGICAL-i119t-ca5f1bce7104e423e80b3d0d042fdd8c334ec718296899bc72ad04df571a9bed3</originalsourceid><addsrcrecordid>eNo1kE1PAjEYhKuJiQT5Bx568Vh8-0W3R1wRTUgkimfSbd-FVdiSdonBX-8a9TQzeSZzGEJuOIw5B3v7guHYBtf6k7Z2osYChBxzkBK4MWdkZI0tpAZZcC2KczIQE6uYFlxfklHO7wAgBSgAPSBxldzh0LQb6tpAp1WOqfpJr9jRWXvcY3JdTJnWMdFlil3c9P0tu3MZA51j2_Nd89X7Rfxk99jmpjvRpUu9sHKL_oOWMWA_lXFf7TBfkYva7TKO_nRI3h5mq_KRLZ7nT-V0wRrObce80zWvPBoOCpWQWEAlAwRQog6h8FIq9IYXwk4KaytvhOtZqLXhzlYY5JBc_-42iLg-pGbv0mn9_5H8BqhBX_o</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Trapping and Absorbing Set Enumerators for Protograph-Based Generalized Low-Density Parity-Check Code Ensembles</title><source>IEEE Xplore All Conference Series</source><creator>Yacoub, Emna Ben</creator><creatorcontrib>Yacoub, Emna Ben</creatorcontrib><description>Generalized low-density parity-check (GLDPC) codes have outstanding performance outperforming the standard low-density parity-check (LDPC) codes. However, the performance of these codes under iterative decoding can be degraded because of the presence of trapping, absorbing and fully absorbing sets in the code Tanner graphs. The (elementary) trapping and (fully) absorbing sets of protograph-based GLDPC codes are studied. The finite-length and asymptotic distributions of (elementary) trapping and (fully) absorbing sets for protograph-based GLDPC code ensembles are derived and evaluated. The asymptotic distributions can be efficiently computed by solving a system of equations. The relative minimum Δ-trapping/(fully) absorbing set size can be directly computed by adding one equation to the system of equations. This is useful for the code design where we can restrict the search to ensembles for which the minimum Δ-trapping and (fully) absorbing set sizes grow linearly with the blocklength. The normalized logarithmic asymptotic distributions of (elementary) trapping and (fully) absorbing sets for an example GLDPC code ensemble are evaluated.</description><identifier>EISSN: 2694-5215</identifier><identifier>EISBN: 9798350381528</identifier><identifier>DOI: 10.1109/Redundancy59964.2023.10330177</identifier><language>eng</language><publisher>IEEE</publisher><subject>Control systems ; Iterative decoding ; Redundancy</subject><ispartof>2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2023, p.142-147</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/10330177$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/10330177$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yacoub, Emna Ben</creatorcontrib><title>Trapping and Absorbing Set Enumerators for Protograph-Based Generalized Low-Density Parity-Check Code Ensembles</title><title>2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)</title><addtitle>Redundancy</addtitle><description>Generalized low-density parity-check (GLDPC) codes have outstanding performance outperforming the standard low-density parity-check (LDPC) codes. However, the performance of these codes under iterative decoding can be degraded because of the presence of trapping, absorbing and fully absorbing sets in the code Tanner graphs. The (elementary) trapping and (fully) absorbing sets of protograph-based GLDPC codes are studied. The finite-length and asymptotic distributions of (elementary) trapping and (fully) absorbing sets for protograph-based GLDPC code ensembles are derived and evaluated. The asymptotic distributions can be efficiently computed by solving a system of equations. The relative minimum Δ-trapping/(fully) absorbing set size can be directly computed by adding one equation to the system of equations. This is useful for the code design where we can restrict the search to ensembles for which the minimum Δ-trapping and (fully) absorbing set sizes grow linearly with the blocklength. The normalized logarithmic asymptotic distributions of (elementary) trapping and (fully) absorbing sets for an example GLDPC code ensemble are evaluated.</description><subject>Control systems</subject><subject>Iterative decoding</subject><subject>Redundancy</subject><issn>2694-5215</issn><isbn>9798350381528</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2023</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNo1kE1PAjEYhKuJiQT5Bx568Vh8-0W3R1wRTUgkimfSbd-FVdiSdonBX-8a9TQzeSZzGEJuOIw5B3v7guHYBtf6k7Z2osYChBxzkBK4MWdkZI0tpAZZcC2KczIQE6uYFlxfklHO7wAgBSgAPSBxldzh0LQb6tpAp1WOqfpJr9jRWXvcY3JdTJnWMdFlil3c9P0tu3MZA51j2_Nd89X7Rfxk99jmpjvRpUu9sHKL_oOWMWA_lXFf7TBfkYva7TKO_nRI3h5mq_KRLZ7nT-V0wRrObce80zWvPBoOCpWQWEAlAwRQog6h8FIq9IYXwk4KaytvhOtZqLXhzlYY5JBc_-42iLg-pGbv0mn9_5H8BqhBX_o</recordid><startdate>20231024</startdate><enddate>20231024</enddate><creator>Yacoub, Emna Ben</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>20231024</creationdate><title>Trapping and Absorbing Set Enumerators for Protograph-Based Generalized Low-Density Parity-Check Code Ensembles</title><author>Yacoub, Emna Ben</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i119t-ca5f1bce7104e423e80b3d0d042fdd8c334ec718296899bc72ad04df571a9bed3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Control systems</topic><topic>Iterative decoding</topic><topic>Redundancy</topic><toplevel>online_resources</toplevel><creatorcontrib>Yacoub, Emna Ben</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore (IEEE/IET Electronic Library - IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Yacoub, Emna Ben</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Trapping and Absorbing Set Enumerators for Protograph-Based Generalized Low-Density Parity-Check Code Ensembles</atitle><btitle>2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY)</btitle><stitle>Redundancy</stitle><date>2023-10-24</date><risdate>2023</risdate><spage>142</spage><epage>147</epage><pages>142-147</pages><eissn>2694-5215</eissn><eisbn>9798350381528</eisbn><abstract>Generalized low-density parity-check (GLDPC) codes have outstanding performance outperforming the standard low-density parity-check (LDPC) codes. However, the performance of these codes under iterative decoding can be degraded because of the presence of trapping, absorbing and fully absorbing sets in the code Tanner graphs. The (elementary) trapping and (fully) absorbing sets of protograph-based GLDPC codes are studied. The finite-length and asymptotic distributions of (elementary) trapping and (fully) absorbing sets for protograph-based GLDPC code ensembles are derived and evaluated. The asymptotic distributions can be efficiently computed by solving a system of equations. The relative minimum Δ-trapping/(fully) absorbing set size can be directly computed by adding one equation to the system of equations. This is useful for the code design where we can restrict the search to ensembles for which the minimum Δ-trapping and (fully) absorbing set sizes grow linearly with the blocklength. The normalized logarithmic asymptotic distributions of (elementary) trapping and (fully) absorbing sets for an example GLDPC code ensemble are evaluated.</abstract><pub>IEEE</pub><doi>10.1109/Redundancy59964.2023.10330177</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier EISSN: 2694-5215
ispartof 2023 XVIII International Symposium Problems of Redundancy in Information and Control Systems (REDUNDANCY), 2023, p.142-147
issn 2694-5215
language eng
recordid cdi_ieee_primary_10330177
source IEEE Xplore All Conference Series
subjects Control systems
Iterative decoding
Redundancy
title Trapping and Absorbing Set Enumerators for Protograph-Based Generalized Low-Density Parity-Check Code Ensembles
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T23%3A41%3A58IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Trapping%20and%20Absorbing%20Set%20Enumerators%20for%20Protograph-Based%20Generalized%20Low-Density%20Parity-Check%20Code%20Ensembles&rft.btitle=2023%20XVIII%20International%20Symposium%20Problems%20of%20Redundancy%20in%20Information%20and%20Control%20Systems%20(REDUNDANCY)&rft.au=Yacoub,%20Emna%20Ben&rft.date=2023-10-24&rft.spage=142&rft.epage=147&rft.pages=142-147&rft.eissn=2694-5215&rft_id=info:doi/10.1109/Redundancy59964.2023.10330177&rft.eisbn=9798350381528&rft_dat=%3Cieee_CHZPO%3E10330177%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i119t-ca5f1bce7104e423e80b3d0d042fdd8c334ec718296899bc72ad04df571a9bed3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=10330177&rfr_iscdi=true