Untainted Puncturing for Irregular Low-Density Parity-Check Codes

Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE wireless communications letters 2012-12, Vol.1 (6), p.585-588
Hauptverfasser:	Elkouss, D., Martinez-Mateo, J., Martin, V.
Format:	Artikel
Sprache:	eng
Schlagworte:	Decoding Encoding Error probability intentional puncturing Iterative decoding Low-density parity-check codes short-length codes Simulation
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	588
container_issue	6
container_start_page	585
container_title	IEEE wireless communications letters
container_volume	1
creator	Elkouss, D. Martinez-Mateo, J. Martin, V.
description	Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.
doi_str_mv	10.1109/WCL.2012.082712.120531
format	Article
fullrecord	<record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_6290312</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6290312</ieee_id><sourcerecordid>3931994771</sourcerecordid><originalsourceid>FETCH-LOGICAL-c303t-3173f44e0e61af28b0bf9ebb8f5173cec9389877534d9378a7011b11cd736dc73</originalsourceid><addsrcrecordid>eNo9kN9LwzAQx4MoOOb-AkEKPnfmkrZpHkf9NSi4B4ePIU0vs3O2M2mR_femVHYv34O7zx18CLkDugSg8uGjKJeMAlvSnIkQwGjK4YLMGGQsZjxJL889F9dk4f2ehsoCA_mMrLZtr5u2xzraDK3pB9e0u8h2Llo7h7vhoF1Udr_xI7a-6U_RRrsQcfGJ5isquhr9Dbmy-uBx8Z9zsn1-ei9e4_LtZV2sythwyvuYg-A2SZBiBtqyvKKVlVhVuU3DxKCRPJe5EClPaslFrgUFqABMLXhWG8Hn5H66e3Tdz4C-V_tucG14qUCkMpFSJONWNm0Z13nv0Kqja761OymgajSmgjE1GlOTMTUZC-DtBDaIeIYyJikHxv8Amjxl2A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1759499747</pqid></control><display><type>article</type><title>Untainted Puncturing for Irregular Low-Density Parity-Check Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Elkouss, D. ; Martinez-Mateo, J. ; Martin, V.</creator><creatorcontrib>Elkouss, D. ; Martinez-Mateo, J. ; Martin, V.</creatorcontrib><description>Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.</description><identifier>ISSN: 2162-2337</identifier><identifier>EISSN: 2162-2345</identifier><identifier>DOI: 10.1109/WCL.2012.082712.120531</identifier><identifier>CODEN: IWCLAF</identifier><language>eng</language><publisher>Piscataway: IEEE</publisher><subject>Decoding ; Encoding ; Error probability ; intentional puncturing ; Iterative decoding ; Low-density parity-check codes ; short-length codes ; Simulation</subject><ispartof>IEEE wireless communications letters, 2012-12, Vol.1 (6), p.585-588</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c303t-3173f44e0e61af28b0bf9ebb8f5173cec9389877534d9378a7011b11cd736dc73</citedby><cites>FETCH-LOGICAL-c303t-3173f44e0e61af28b0bf9ebb8f5173cec9389877534d9378a7011b11cd736dc73</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6290312$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,782,786,798,27933,27934,54767</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6290312$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Elkouss, D.</creatorcontrib><creatorcontrib>Martinez-Mateo, J.</creatorcontrib><creatorcontrib>Martin, V.</creatorcontrib><title>Untainted Puncturing for Irregular Low-Density Parity-Check Codes</title><title>IEEE wireless communications letters</title><addtitle>LWC</addtitle><description>Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.</description><subject>Decoding</subject><subject>Encoding</subject><subject>Error probability</subject><subject>intentional puncturing</subject><subject>Iterative decoding</subject><subject>Low-density parity-check codes</subject><subject>short-length codes</subject><subject>Simulation</subject><issn>2162-2337</issn><issn>2162-2345</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kN9LwzAQx4MoOOb-AkEKPnfmkrZpHkf9NSi4B4ePIU0vs3O2M2mR_femVHYv34O7zx18CLkDugSg8uGjKJeMAlvSnIkQwGjK4YLMGGQsZjxJL889F9dk4f2ehsoCA_mMrLZtr5u2xzraDK3pB9e0u8h2Llo7h7vhoF1Udr_xI7a-6U_RRrsQcfGJ5isquhr9Dbmy-uBx8Z9zsn1-ei9e4_LtZV2sythwyvuYg-A2SZBiBtqyvKKVlVhVuU3DxKCRPJe5EClPaslFrgUFqABMLXhWG8Hn5H66e3Tdz4C-V_tucG14qUCkMpFSJONWNm0Z13nv0Kqja761OymgajSmgjE1GlOTMTUZC-DtBDaIeIYyJikHxv8Amjxl2A</recordid><startdate>20121201</startdate><enddate>20121201</enddate><creator>Elkouss, D.</creator><creator>Martinez-Mateo, J.</creator><creator>Martin, V.</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></search><sort><creationdate>20121201</creationdate><title>Untainted Puncturing for Irregular Low-Density Parity-Check Codes</title><author>Elkouss, D. ; Martinez-Mateo, J. ; Martin, V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c303t-3173f44e0e61af28b0bf9ebb8f5173cec9389877534d9378a7011b11cd736dc73</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Decoding</topic><topic>Encoding</topic><topic>Error probability</topic><topic>intentional puncturing</topic><topic>Iterative decoding</topic><topic>Low-density parity-check codes</topic><topic>short-length codes</topic><topic>Simulation</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Elkouss, D.</creatorcontrib><creatorcontrib>Martinez-Mateo, J.</creatorcontrib><creatorcontrib>Martin, V.</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 wireless communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Elkouss, D.</au><au>Martinez-Mateo, J.</au><au>Martin, V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Untainted Puncturing for Irregular Low-Density Parity-Check Codes</atitle><jtitle>IEEE wireless communications letters</jtitle><stitle>LWC</stitle><date>2012-12-01</date><risdate>2012</risdate><volume>1</volume><issue>6</issue><spage>585</spage><epage>588</epage><pages>585-588</pages><issn>2162-2337</issn><eissn>2162-2345</eissn><coden>IWCLAF</coden><abstract>Puncturing is a well-known coding technique widely used for constructing rate-compatible codes. In this paper, we consider the problem of puncturing low-density parity-check codes and propose a new algorithm for intentional puncturing. The algorithm is based on the puncturing of untainted symbols, i.e. nodes with no punctured symbols within their neighboring set. It is shown that the algorithm proposed here performs better than previous proposals for a range of coding rates and short proportions of punctured symbols.</abstract><cop>Piscataway</cop><pub>IEEE</pub><doi>10.1109/WCL.2012.082712.120531</doi><tpages>4</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 2162-2337
ispartof	IEEE wireless communications letters, 2012-12, Vol.1 (6), p.585-588
issn	2162-2337 2162-2345
language	eng
recordid	cdi_ieee_primary_6290312
source	IEEE Electronic Library (IEL)
subjects	Decoding Encoding Error probability intentional puncturing Iterative decoding Low-density parity-check codes short-length codes Simulation
title	Untainted Puncturing for Irregular Low-Density Parity-Check 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-02T13%3A50%3A51IST&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=Untainted%20Puncturing%20for%20Irregular%20Low-Density%20Parity-Check%20Codes&rft.jtitle=IEEE%20wireless%20communications%20letters&rft.au=Elkouss,%20D.&rft.date=2012-12-01&rft.volume=1&rft.issue=6&rft.spage=585&rft.epage=588&rft.pages=585-588&rft.issn=2162-2337&rft.eissn=2162-2345&rft.coden=IWCLAF&rft_id=info:doi/10.1109/WCL.2012.082712.120531&rft_dat=%3Cproquest_RIE%3E3931994771%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=1759499747&rft_id=info:pmid/&rft_ieee_id=6290312&rfr_iscdi=true