Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on Packings
This paper presents two packings derived from balanced incomplete block designs to construct quasi-cyclic spatially coupled LDPC convolutional codes (SC-LDPC-CCs). The construction gives time-invariant codes, since the sub-blocks corresponding to each time instant of the parity-check matrix are iden...
Gespeichert in:
| Veröffentlicht in: | IEEE transactions on communications 2016-12, Vol.64 (12), p.4936-4945 |
|---|---|
| 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 | 4945 |
|---|---|
| container_issue | 12 |
| container_start_page | 4936 |
| container_title | IEEE transactions on communications |
| container_volume | 64 |
| creator | Zhang, Mu Wang, Zulin Huang, Qin Wang, Shafei |
| description | This paper presents two packings derived from balanced incomplete block designs to construct quasi-cyclic spatially coupled LDPC convolutional codes (SC-LDPC-CCs). The construction gives time-invariant codes, since the sub-blocks corresponding to each time instant of the parity-check matrix are identical. Moreover, it provides flexible design rates and constraint lengths. Simulation results show that the proposed packing-based SC-LDPC-CCs outperform the existing time-invariant codes and perform closely to the time-varying protograph-based codes. |
| doi_str_mv | 10.1109/TCOMM.2016.2613107 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1850230898</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>7592443</ieee_id><sourcerecordid>1850230898</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-29cec11597492933d0324b9e1f2818d48da968a5c73f25bd2b472bf5b94458553</originalsourceid><addsrcrecordid>eNo9kF1LwzAUhoMoOKd_QG8KXneefDXJpdapk41NnNchTVPJ7NratML-vZ0bXh3ew_ucAw9C1xgmGIO6W6fLxWJCACcTkmCKQZygEeZcxiC5OEUjAAVxIoQ8RxchbACAAaUj9Lr2WxfPqh_TelN10Vtvgo_TnS29jd4b03lTlrsorfumdHk0f1ylQ8hdiB5MGBZ1Fa2M_fLVZ7hEZ4Upg7s6zjH6eJqu05d4vnyepffz2BLFu5go6yzGXAmmiKI0B0pYphwuiMQyZzI3KpGGW0ELwrOcZEyQrOCZYoxLzukY3R7uNm393bvQ6U3dt9XwUmPJgVCQSg4tcmjZtg6hdYVuWr817U5j0Htn-s-Z3jvTR2cDdHOAvHPuHxBcEcYo_QVO6mW0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1850230898</pqid></control><display><type>article</type><title>Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on Packings</title><source>IEEE Explore</source><creator>Zhang, Mu ; Wang, Zulin ; Huang, Qin ; Wang, Shafei</creator><creatorcontrib>Zhang, Mu ; Wang, Zulin ; Huang, Qin ; Wang, Shafei</creatorcontrib><description>This paper presents two packings derived from balanced incomplete block designs to construct quasi-cyclic spatially coupled LDPC convolutional codes (SC-LDPC-CCs). The construction gives time-invariant codes, since the sub-blocks corresponding to each time instant of the parity-check matrix are identical. Moreover, it provides flexible design rates and constraint lengths. Simulation results show that the proposed packing-based SC-LDPC-CCs outperform the existing time-invariant codes and perform closely to the time-varying protograph-based codes.</description><identifier>ISSN: 0090-6778</identifier><identifier>EISSN: 1558-0857</identifier><identifier>DOI: 10.1109/TCOMM.2016.2613107</identifier><identifier>CODEN: IECMBT</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>BIBD ; Codes ; Constraint modelling ; Convolutional codes ; CPM ; Data communication ; Decoding ; Invariants ; packing ; Parity check codes ; Simulation ; spatially coupled LDPC ; Symmetric matrices ; time-invariant</subject><ispartof>IEEE transactions on communications, 2016-12, Vol.64 (12), p.4936-4945</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2016</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-29cec11597492933d0324b9e1f2818d48da968a5c73f25bd2b472bf5b94458553</citedby><cites>FETCH-LOGICAL-c295t-29cec11597492933d0324b9e1f2818d48da968a5c73f25bd2b472bf5b94458553</cites><orcidid>0000-0003-1621-6984</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/7592443$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/7592443$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Zhang, Mu</creatorcontrib><creatorcontrib>Wang, Zulin</creatorcontrib><creatorcontrib>Huang, Qin</creatorcontrib><creatorcontrib>Wang, Shafei</creatorcontrib><title>Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on Packings</title><title>IEEE transactions on communications</title><addtitle>TCOMM</addtitle><description>This paper presents two packings derived from balanced incomplete block designs to construct quasi-cyclic spatially coupled LDPC convolutional codes (SC-LDPC-CCs). The construction gives time-invariant codes, since the sub-blocks corresponding to each time instant of the parity-check matrix are identical. Moreover, it provides flexible design rates and constraint lengths. Simulation results show that the proposed packing-based SC-LDPC-CCs outperform the existing time-invariant codes and perform closely to the time-varying protograph-based codes.</description><subject>BIBD</subject><subject>Codes</subject><subject>Constraint modelling</subject><subject>Convolutional codes</subject><subject>CPM</subject><subject>Data communication</subject><subject>Decoding</subject><subject>Invariants</subject><subject>packing</subject><subject>Parity check codes</subject><subject>Simulation</subject><subject>spatially coupled LDPC</subject><subject>Symmetric matrices</subject><subject>time-invariant</subject><issn>0090-6778</issn><issn>1558-0857</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2016</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kF1LwzAUhoMoOKd_QG8KXneefDXJpdapk41NnNchTVPJ7NratML-vZ0bXh3ew_ucAw9C1xgmGIO6W6fLxWJCACcTkmCKQZygEeZcxiC5OEUjAAVxIoQ8RxchbACAAaUj9Lr2WxfPqh_TelN10Vtvgo_TnS29jd4b03lTlrsorfumdHk0f1ylQ8hdiB5MGBZ1Fa2M_fLVZ7hEZ4Upg7s6zjH6eJqu05d4vnyepffz2BLFu5go6yzGXAmmiKI0B0pYphwuiMQyZzI3KpGGW0ELwrOcZEyQrOCZYoxLzukY3R7uNm393bvQ6U3dt9XwUmPJgVCQSg4tcmjZtg6hdYVuWr817U5j0Htn-s-Z3jvTR2cDdHOAvHPuHxBcEcYo_QVO6mW0</recordid><startdate>201612</startdate><enddate>201612</enddate><creator>Zhang, Mu</creator><creator>Wang, Zulin</creator><creator>Huang, Qin</creator><creator>Wang, Shafei</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-0003-1621-6984</orcidid></search><sort><creationdate>201612</creationdate><title>Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on Packings</title><author>Zhang, Mu ; Wang, Zulin ; Huang, Qin ; Wang, Shafei</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-29cec11597492933d0324b9e1f2818d48da968a5c73f25bd2b472bf5b94458553</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2016</creationdate><topic>BIBD</topic><topic>Codes</topic><topic>Constraint modelling</topic><topic>Convolutional codes</topic><topic>CPM</topic><topic>Data communication</topic><topic>Decoding</topic><topic>Invariants</topic><topic>packing</topic><topic>Parity check codes</topic><topic>Simulation</topic><topic>spatially coupled LDPC</topic><topic>Symmetric matrices</topic><topic>time-invariant</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Zhang, Mu</creatorcontrib><creatorcontrib>Wang, Zulin</creatorcontrib><creatorcontrib>Huang, Qin</creatorcontrib><creatorcontrib>Wang, Shafei</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Explore</collection><collection>CrossRef</collection><collection>Electronics & Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>IEEE transactions on communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Zhang, Mu</au><au>Wang, Zulin</au><au>Huang, Qin</au><au>Wang, Shafei</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on Packings</atitle><jtitle>IEEE transactions on communications</jtitle><stitle>TCOMM</stitle><date>2016-12</date><risdate>2016</risdate><volume>64</volume><issue>12</issue><spage>4936</spage><epage>4945</epage><pages>4936-4945</pages><issn>0090-6778</issn><eissn>1558-0857</eissn><coden>IECMBT</coden><abstract>This paper presents two packings derived from balanced incomplete block designs to construct quasi-cyclic spatially coupled LDPC convolutional codes (SC-LDPC-CCs). The construction gives time-invariant codes, since the sub-blocks corresponding to each time instant of the parity-check matrix are identical. Moreover, it provides flexible design rates and constraint lengths. Simulation results show that the proposed packing-based SC-LDPC-CCs outperform the existing time-invariant codes and perform closely to the time-varying protograph-based codes.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/TCOMM.2016.2613107</doi><tpages>10</tpages><orcidid>https://orcid.org/0000-0003-1621-6984</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 0090-6778 |
| ispartof | IEEE transactions on communications, 2016-12, Vol.64 (12), p.4936-4945 |
| issn | 0090-6778 1558-0857 |
| language | eng |
| recordid | cdi_proquest_journals_1850230898 |
| source | IEEE Explore |
| subjects | BIBD Codes Constraint modelling Convolutional codes CPM Data communication Decoding Invariants packing Parity check codes Simulation spatially coupled LDPC Symmetric matrices time-invariant |
| title | Time-Invariant Quasi-Cyclic Spatially Coupled LDPC Codes Based on Packings |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-07T17%3A33%3A14IST&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=Time-Invariant%20Quasi-Cyclic%20Spatially%20Coupled%20LDPC%20Codes%20Based%20on%20Packings&rft.jtitle=IEEE%20transactions%20on%20communications&rft.au=Zhang,%20Mu&rft.date=2016-12&rft.volume=64&rft.issue=12&rft.spage=4936&rft.epage=4945&rft.pages=4936-4945&rft.issn=0090-6778&rft.eissn=1558-0857&rft.coden=IECMBT&rft_id=info:doi/10.1109/TCOMM.2016.2613107&rft_dat=%3Cproquest_RIE%3E1850230898%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=1850230898&rft_id=info:pmid/&rft_ieee_id=7592443&rfr_iscdi=true |