Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs
Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on information theory 2014-10, Vol.60 (10), p.5856-5874 |
|---|---|
| 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 | 5874 |
|---|---|
| container_issue | 10 |
| container_start_page | 5856 |
| container_title | IEEE transactions on information theory |
| container_volume | 60 |
| creator | Mitchell, David G. M. Smarandache, Roxana Costello, Daniel J. |
| description | Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results. |
| doi_str_mv | 10.1109/TIT.2014.2342735 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6863699</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6863699</ieee_id><sourcerecordid>3453367891</sourcerecordid><originalsourceid>FETCH-LOGICAL-c333t-2a86ad74b9e575eec18032f44e443dc5218a7826e491c0927d40596c87587093</originalsourceid><addsrcrecordid>eNo9kE1LAzEURYMoWKt7wc2A69S8fGepY9XCgBVmH2LmjU6pnZpMF_33Tmlx9bhw7n1wCLkFNgNg7qFe1DPOQM64kNwIdUYmoJShTit5TiaMgaVOSntJrnJejVEq4BNiPnYhd7Tcx3UXi-p5WRZl32AunkLGpug3xTIhrbp2GNMy9UP_lcL2O1-TizasM96c7pTUL_O6fKPV--uifKxoFEIMlAerQ2Pkp0NlFGIEywRvpUQpRRMVBxuM5Rqlg8gcN41kyulojbKGOTEl98fZbep_d5gHv-p3aTN-9KCZlsCBs5FiRyqmPueErd-m7iekvQfmD3b8aMcf7PiTnbFyd6x0iPiPa6uFdk78AUd6XNk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1606412120</pqid></control><display><type>article</type><title>Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs</title><source>IEEE/IET Electronic Library</source><creator>Mitchell, David G. M. ; Smarandache, Roxana ; Costello, Daniel J.</creator><creatorcontrib>Mitchell, David G. M. ; Smarandache, Roxana ; Costello, Daniel J.</creatorcontrib><description>Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.</description><identifier>ISSN: 0018-9448</identifier><identifier>EISSN: 1557-9654</identifier><identifier>DOI: 10.1109/TIT.2014.2342735</identifier><identifier>CODEN: IETTAW</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Arrays ; Codes ; Density ; Electronics ; Hamming distance ; Iterative decoding ; Materials ; Matrix ; Parity ; Simulation</subject><ispartof>IEEE transactions on information theory, 2014-10, Vol.60 (10), p.5856-5874</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2014</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c333t-2a86ad74b9e575eec18032f44e443dc5218a7826e491c0927d40596c87587093</citedby><cites>FETCH-LOGICAL-c333t-2a86ad74b9e575eec18032f44e443dc5218a7826e491c0927d40596c87587093</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6863699$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6863699$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mitchell, David G. M.</creatorcontrib><creatorcontrib>Smarandache, Roxana</creatorcontrib><creatorcontrib>Costello, Daniel J.</creatorcontrib><title>Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs</title><title>IEEE transactions on information theory</title><addtitle>TIT</addtitle><description>Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.</description><subject>Arrays</subject><subject>Codes</subject><subject>Density</subject><subject>Electronics</subject><subject>Hamming distance</subject><subject>Iterative decoding</subject><subject>Materials</subject><subject>Matrix</subject><subject>Parity</subject><subject>Simulation</subject><issn>0018-9448</issn><issn>1557-9654</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kE1LAzEURYMoWKt7wc2A69S8fGepY9XCgBVmH2LmjU6pnZpMF_33Tmlx9bhw7n1wCLkFNgNg7qFe1DPOQM64kNwIdUYmoJShTit5TiaMgaVOSntJrnJejVEq4BNiPnYhd7Tcx3UXi-p5WRZl32AunkLGpug3xTIhrbp2GNMy9UP_lcL2O1-TizasM96c7pTUL_O6fKPV--uifKxoFEIMlAerQ2Pkp0NlFGIEywRvpUQpRRMVBxuM5Rqlg8gcN41kyulojbKGOTEl98fZbep_d5gHv-p3aTN-9KCZlsCBs5FiRyqmPueErd-m7iekvQfmD3b8aMcf7PiTnbFyd6x0iPiPa6uFdk78AUd6XNk</recordid><startdate>201410</startdate><enddate>201410</enddate><creator>Mitchell, David G. M.</creator><creator>Smarandache, Roxana</creator><creator>Costello, Daniel J.</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>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>201410</creationdate><title>Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs</title><author>Mitchell, David G. M. ; Smarandache, Roxana ; Costello, Daniel J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c333t-2a86ad74b9e575eec18032f44e443dc5218a7826e491c0927d40596c87587093</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Arrays</topic><topic>Codes</topic><topic>Density</topic><topic>Electronics</topic><topic>Hamming distance</topic><topic>Iterative decoding</topic><topic>Materials</topic><topic>Matrix</topic><topic>Parity</topic><topic>Simulation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mitchell, David G. M.</creatorcontrib><creatorcontrib>Smarandache, Roxana</creatorcontrib><creatorcontrib>Costello, Daniel J.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE/IET Electronic Library</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>IEEE transactions on information theory</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mitchell, David G. M.</au><au>Smarandache, Roxana</au><au>Costello, Daniel J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs</atitle><jtitle>IEEE transactions on information theory</jtitle><stitle>TIT</stitle><date>2014-10</date><risdate>2014</risdate><volume>60</volume><issue>10</issue><spage>5856</spage><epage>5874</epage><pages>5856-5874</pages><issn>0018-9448</issn><eissn>1557-9654</eissn><coden>IETTAW</coden><abstract>Quasi-cyclic low-density parity-check (QC-LDPC) codes based on protographs are of great interest to code designers because analysis and implementation are facilitated by the protograph structure and the use of circulant permutation matrices for protograph lifting. However, these restrictions impose undesirable fixed upper limits on important code parameters, such as minimum distance and girth. In this paper, we consider an approach to constructing QC-LDPC codes that uses a two-step lifting procedure based on a protograph, and, by following this method instead of the usual one-step procedure, we obtain improved minimum distance and girth properties. We also present two new design rules for constructing good QC-LDPC codes using this two-step lifting procedure, and in each case, we obtain a significant increase in minimum distance and achieve a certain guaranteed girth compared with one-step circulant-based liftings. The expected performance improvement is verified by simulation results.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TIT.2014.2342735</doi><tpages>19</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0018-9448 |
| ispartof | IEEE transactions on information theory, 2014-10, Vol.60 (10), p.5856-5874 |
| issn | 0018-9448 1557-9654 |
| language | eng |
| recordid | cdi_ieee_primary_6863699 |
| source | IEEE/IET Electronic Library |
| subjects | Arrays Codes Density Electronics Hamming distance Iterative decoding Materials Matrix Parity Simulation |
| title | Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T07%3A30%3A34IST&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=Quasi-Cyclic%20LDPC%20Codes%20Based%20on%20Pre-Lifted%20Protographs&rft.jtitle=IEEE%20transactions%20on%20information%20theory&rft.au=Mitchell,%20David%20G.%20M.&rft.date=2014-10&rft.volume=60&rft.issue=10&rft.spage=5856&rft.epage=5874&rft.pages=5856-5874&rft.issn=0018-9448&rft.eissn=1557-9654&rft.coden=IETTAW&rft_id=info:doi/10.1109/TIT.2014.2342735&rft_dat=%3Cproquest_RIE%3E3453367891%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=1606412120&rft_id=info:pmid/&rft_ieee_id=6863699&rfr_iscdi=true |