Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm
In this letter we propose a new approach to generation of regular QC-LDPC codes with girth up to 12. The aim of the proposed smart exhaustive search (SES) algorithm is to construct codes with the desired lifting factor or to check whether codes with this parameter even exist. We define new lower bou...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2022-05, Vol.26 (5), p.964-968 |
|---|---|
| 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 | 968 |
|---|---|
| container_issue | 5 |
| container_start_page | 964 |
| container_title | IEEE communications letters |
| container_volume | 26 |
| creator | Kharin, Aleksei Dryakhlov, Aleksei Zavertkin, Konstantin Ovinnikov, Aleksei Likhobabin, Evgeny |
| description | In this letter we propose a new approach to generation of regular QC-LDPC codes with girth up to 12. The aim of the proposed smart exhaustive search (SES) algorithm is to construct codes with the desired lifting factor or to check whether codes with this parameter even exist. We define new lower bounds on the lifting degree as a necessary condition for the lifted graph to have a certain girth from fully connected base graphs. This modification opens space for improvement of the lifting factor minimisation problem for QC-LDPC code construction. With a more precisely defined search region it is possible to achieve better results with existing algorithms. |
| doi_str_mv | 10.1109/LCOMM.2022.3154799 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_2662095981</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9721882</ieee_id><sourcerecordid>2662095981</sourcerecordid><originalsourceid>FETCH-LOGICAL-c161t-46d296decf5647edbc48e4e2a6881fc57b108676d111100bb4dc2b627a317b173</originalsourceid><addsrcrecordid>eNo9kE1PwzAMhiMEEmPwB-ASiXNHkrb5OG5lDKROAwbnqG3c0WlrRtJq4t-TsQkfbEt-X9t6ELqlZEQpUQ95tpjPR4wwNoppmgilztCApqmMWEjnoSdSRUIoeYmuvF8TQiRL6QBNcrsHhye2b43HtsbvsOo3hcNvWZQ_vmY4swY8LlqDl9MlnkELruga2-LxZmVd031tr9FFXWw83JzqEH0-TT-y5yhfzF6ycR5VlNMuSrhhihuo6pQnAkxZJRISYAWXktZVKsrwIxfc0BCElGViKlZyJoqYhpmIh-j-uHfn7HcPvtNr27s2nNSMc0ZUqiQNKnZUVc5676DWO9dsC_ejKdEHVvqPlT6w0idWwXR3NDUA8G9QglEpWfwLWDpi3g</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2662095981</pqid></control><display><type>article</type><title>Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm</title><source>IEEE Electronic Library (IEL)</source><creator>Kharin, Aleksei ; Dryakhlov, Aleksei ; Zavertkin, Konstantin ; Ovinnikov, Aleksei ; Likhobabin, Evgeny</creator><creatorcontrib>Kharin, Aleksei ; Dryakhlov, Aleksei ; Zavertkin, Konstantin ; Ovinnikov, Aleksei ; Likhobabin, Evgeny</creatorcontrib><description>In this letter we propose a new approach to generation of regular QC-LDPC codes with girth up to 12. The aim of the proposed smart exhaustive search (SES) algorithm is to construct codes with the desired lifting factor or to check whether codes with this parameter even exist. We define new lower bounds on the lifting degree as a necessary condition for the lifted graph to have a certain girth from fully connected base graphs. This modification opens space for improvement of the lifting factor minimisation problem for QC-LDPC code construction. With a more precisely defined search region it is possible to achieve better results with existing algorithms.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2022.3154799</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; bounds on girth ; Codes ; Complexity theory ; cyclic lifting ; Estimation ; girth ; Hoisting ; Low density parity check codes ; Lower bounds ; Mathematical models ; Minimization ; Parity check codes ; Prediction algorithms ; quasi-cyclic (QC) ; Regular LDPC ; Switches</subject><ispartof>IEEE communications letters, 2022-05, Vol.26 (5), p.964-968</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c161t-46d296decf5647edbc48e4e2a6881fc57b108676d111100bb4dc2b627a317b173</cites><orcidid>0000-0002-3871-9470 ; 0000-0002-2897-8532 ; 0000-0002-3178-7593 ; 0000-0003-1227-2575</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9721882$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9721882$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kharin, Aleksei</creatorcontrib><creatorcontrib>Dryakhlov, Aleksei</creatorcontrib><creatorcontrib>Zavertkin, Konstantin</creatorcontrib><creatorcontrib>Ovinnikov, Aleksei</creatorcontrib><creatorcontrib>Likhobabin, Evgeny</creatorcontrib><title>Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm</title><title>IEEE communications letters</title><addtitle>LCOMM</addtitle><description>In this letter we propose a new approach to generation of regular QC-LDPC codes with girth up to 12. The aim of the proposed smart exhaustive search (SES) algorithm is to construct codes with the desired lifting factor or to check whether codes with this parameter even exist. We define new lower bounds on the lifting degree as a necessary condition for the lifted graph to have a certain girth from fully connected base graphs. This modification opens space for improvement of the lifting factor minimisation problem for QC-LDPC code construction. With a more precisely defined search region it is possible to achieve better results with existing algorithms.</description><subject>Algorithms</subject><subject>bounds on girth</subject><subject>Codes</subject><subject>Complexity theory</subject><subject>cyclic lifting</subject><subject>Estimation</subject><subject>girth</subject><subject>Hoisting</subject><subject>Low density parity check codes</subject><subject>Lower bounds</subject><subject>Mathematical models</subject><subject>Minimization</subject><subject>Parity check codes</subject><subject>Prediction algorithms</subject><subject>quasi-cyclic (QC)</subject><subject>Regular LDPC</subject><subject>Switches</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1PwzAMhiMEEmPwB-ASiXNHkrb5OG5lDKROAwbnqG3c0WlrRtJq4t-TsQkfbEt-X9t6ELqlZEQpUQ95tpjPR4wwNoppmgilztCApqmMWEjnoSdSRUIoeYmuvF8TQiRL6QBNcrsHhye2b43HtsbvsOo3hcNvWZQ_vmY4swY8LlqDl9MlnkELruga2-LxZmVd031tr9FFXWw83JzqEH0-TT-y5yhfzF6ycR5VlNMuSrhhihuo6pQnAkxZJRISYAWXktZVKsrwIxfc0BCElGViKlZyJoqYhpmIh-j-uHfn7HcPvtNr27s2nNSMc0ZUqiQNKnZUVc5676DWO9dsC_ejKdEHVvqPlT6w0idWwXR3NDUA8G9QglEpWfwLWDpi3g</recordid><startdate>202205</startdate><enddate>202205</enddate><creator>Kharin, Aleksei</creator><creator>Dryakhlov, Aleksei</creator><creator>Zavertkin, Konstantin</creator><creator>Ovinnikov, Aleksei</creator><creator>Likhobabin, Evgeny</creator><general>IEEE</general><general>The Institute of Electrical and Electronics Engineers, Inc. (IEEE)</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SP</scope><scope>8FD</scope><scope>L7M</scope><orcidid>https://orcid.org/0000-0002-3871-9470</orcidid><orcidid>https://orcid.org/0000-0002-2897-8532</orcidid><orcidid>https://orcid.org/0000-0002-3178-7593</orcidid><orcidid>https://orcid.org/0000-0003-1227-2575</orcidid></search><sort><creationdate>202205</creationdate><title>Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm</title><author>Kharin, Aleksei ; Dryakhlov, Aleksei ; Zavertkin, Konstantin ; Ovinnikov, Aleksei ; Likhobabin, Evgeny</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c161t-46d296decf5647edbc48e4e2a6881fc57b108676d111100bb4dc2b627a317b173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>bounds on girth</topic><topic>Codes</topic><topic>Complexity theory</topic><topic>cyclic lifting</topic><topic>Estimation</topic><topic>girth</topic><topic>Hoisting</topic><topic>Low density parity check codes</topic><topic>Lower bounds</topic><topic>Mathematical models</topic><topic>Minimization</topic><topic>Parity check codes</topic><topic>Prediction algorithms</topic><topic>quasi-cyclic (QC)</topic><topic>Regular LDPC</topic><topic>Switches</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kharin, Aleksei</creatorcontrib><creatorcontrib>Dryakhlov, Aleksei</creatorcontrib><creatorcontrib>Zavertkin, Konstantin</creatorcontrib><creatorcontrib>Ovinnikov, Aleksei</creatorcontrib><creatorcontrib>Likhobabin, Evgeny</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><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kharin, Aleksei</au><au>Dryakhlov, Aleksei</au><au>Zavertkin, Konstantin</au><au>Ovinnikov, Aleksei</au><au>Likhobabin, Evgeny</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm</atitle><jtitle>IEEE communications letters</jtitle><stitle>LCOMM</stitle><date>2022-05</date><risdate>2022</risdate><volume>26</volume><issue>5</issue><spage>964</spage><epage>968</epage><pages>964-968</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>In this letter we propose a new approach to generation of regular QC-LDPC codes with girth up to 12. The aim of the proposed smart exhaustive search (SES) algorithm is to construct codes with the desired lifting factor or to check whether codes with this parameter even exist. We define new lower bounds on the lifting degree as a necessary condition for the lifted graph to have a certain girth from fully connected base graphs. This modification opens space for improvement of the lifting factor minimisation problem for QC-LDPC code construction. With a more precisely defined search region it is possible to achieve better results with existing algorithms.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2022.3154799</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0002-3871-9470</orcidid><orcidid>https://orcid.org/0000-0002-2897-8532</orcidid><orcidid>https://orcid.org/0000-0002-3178-7593</orcidid><orcidid>https://orcid.org/0000-0003-1227-2575</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2022-05, Vol.26 (5), p.964-968 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_proquest_journals_2662095981 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms bounds on girth Codes Complexity theory cyclic lifting Estimation girth Hoisting Low density parity check codes Lower bounds Mathematical models Minimization Parity check codes Prediction algorithms quasi-cyclic (QC) Regular LDPC Switches |
| title | Lower Bounds of Regular QC-LDPC Codes and SES Generation Algorithm |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T05%3A14%3A42IST&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=Lower%20Bounds%20of%20Regular%20QC-LDPC%20Codes%20and%20SES%20Generation%20Algorithm&rft.jtitle=IEEE%20communications%20letters&rft.au=Kharin,%20Aleksei&rft.date=2022-05&rft.volume=26&rft.issue=5&rft.spage=964&rft.epage=968&rft.pages=964-968&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2022.3154799&rft_dat=%3Cproquest_RIE%3E2662095981%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=2662095981&rft_id=info:pmid/&rft_ieee_id=9721882&rfr_iscdi=true |