Low-Complexity Soft-Output Decoding of Polar Codes

The state-of-the-art soft-output decoder for polar codes is a message-passing algorithm based on belief propagation, which performs well at the cost of high processing and storage requirements. In this paper, we propose a low-complexity alternative for soft-output decoding of polar codes that offers...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE journal on selected areas in communications 2014-05, Vol.32 (5), p.958-966
Hauptverfasser: Fayyaz, Ubaid U., Barry, John R.
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 966
container_issue 5
container_start_page 958
container_title IEEE journal on selected areas in communications
container_volume 32
creator Fayyaz, Ubaid U.
Barry, John R.
description The state-of-the-art soft-output decoder for polar codes is a message-passing algorithm based on belief propagation, which performs well at the cost of high processing and storage requirements. In this paper, we propose a low-complexity alternative for soft-output decoding of polar codes that offers better performance but with significantly reduced processing and storage requirements. In particular we show that the complexity of the proposed decoder is only 4% of the total complexity of the belief propagation decoder for a rate one-half polar code of dimension 4096 in the dicode channel, while achieving comparable error-rate performance. Furthermore, we show that the proposed decoder requires about 39% of the memory required by the belief propagation decoder for a block length of 32768.
doi_str_mv 10.1109/JSAC.2014.140515
format Article
fullrecord <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_proquest_journals_1545894616</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6804940</ieee_id><sourcerecordid>1671601519</sourcerecordid><originalsourceid>FETCH-LOGICAL-c390t-4bb22611aef6685f4459de823114fc12a10a1ad8cef5e0093f0e815a6e6661933</originalsourceid><addsrcrecordid>eNpdkEtLw0AUhQdRsEb3gpuAGzep92YenSxLfFOoUF0P0-SOpKSdmEnQ_ntTIi5cnc13Lvd8jF0iTBEhu31ZzfNpCiimKECiPGITlFInAKCP2QRmnCd6huqUnYWwgQEUOp2wdOG_ktxvm5q-q24fr7zrkmXfNX0X31Hhy2r3EXsXv_ratnHuSwrn7MTZOtDFb0bs_eH-LX9KFsvH53y-SAqeQZeI9TpNFaIlp5SWTgiZlaRTjihcgalFsGhLXZCTBJBxB6RRWkVKKcw4j9jNeLdp_WdPoTPbKhRU13ZHvg8G1TAHUA5sxK7_oRvft7vhO4NSSJ0JhWqgYKSK1ofQkjNNW21tuzcI5iDRHCSag0QzShwqV2OlIqI_XGkQmQD-A9-caoI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1545894616</pqid></control><display><type>article</type><title>Low-Complexity Soft-Output Decoding of Polar Codes</title><source>IEL</source><creator>Fayyaz, Ubaid U. ; Barry, John R.</creator><creatorcontrib>Fayyaz, Ubaid U. ; Barry, John R.</creatorcontrib><description>The state-of-the-art soft-output decoder for polar codes is a message-passing algorithm based on belief propagation, which performs well at the cost of high processing and storage requirements. In this paper, we propose a low-complexity alternative for soft-output decoding of polar codes that offers better performance but with significantly reduced processing and storage requirements. In particular we show that the complexity of the proposed decoder is only 4% of the total complexity of the belief propagation decoder for a rate one-half polar code of dimension 4096 in the dicode channel, while achieving comparable error-rate performance. Furthermore, we show that the proposed decoder requires about 39% of the memory required by the belief propagation decoder for a block length of 32768.</description><identifier>ISSN: 0733-8716</identifier><identifier>EISSN: 1558-0008</identifier><identifier>DOI: 10.1109/JSAC.2014.140515</identifier><identifier>CODEN: ISACEM</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Belief propagation ; Blocking ; Channels ; Complexity ; Complexity theory ; Decoders ; Decoding ; Iterative decoding ; Memory management ; Polar codes ; Receivers ; soft-output decoding ; State of the art ; turbo equalization</subject><ispartof>IEEE journal on selected areas in communications, 2014-05, Vol.32 (5), p.958-966</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c390t-4bb22611aef6685f4459de823114fc12a10a1ad8cef5e0093f0e815a6e6661933</citedby><cites>FETCH-LOGICAL-c390t-4bb22611aef6685f4459de823114fc12a10a1ad8cef5e0093f0e815a6e6661933</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6804940$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,776,780,792,27901,27902,54733</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6804940$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Fayyaz, Ubaid U.</creatorcontrib><creatorcontrib>Barry, John R.</creatorcontrib><title>Low-Complexity Soft-Output Decoding of Polar Codes</title><title>IEEE journal on selected areas in communications</title><addtitle>J-SAC</addtitle><description>The state-of-the-art soft-output decoder for polar codes is a message-passing algorithm based on belief propagation, which performs well at the cost of high processing and storage requirements. In this paper, we propose a low-complexity alternative for soft-output decoding of polar codes that offers better performance but with significantly reduced processing and storage requirements. In particular we show that the complexity of the proposed decoder is only 4% of the total complexity of the belief propagation decoder for a rate one-half polar code of dimension 4096 in the dicode channel, while achieving comparable error-rate performance. Furthermore, we show that the proposed decoder requires about 39% of the memory required by the belief propagation decoder for a block length of 32768.</description><subject>Algorithms</subject><subject>Belief propagation</subject><subject>Blocking</subject><subject>Channels</subject><subject>Complexity</subject><subject>Complexity theory</subject><subject>Decoders</subject><subject>Decoding</subject><subject>Iterative decoding</subject><subject>Memory management</subject><subject>Polar codes</subject><subject>Receivers</subject><subject>soft-output decoding</subject><subject>State of the art</subject><subject>turbo equalization</subject><issn>0733-8716</issn><issn>1558-0008</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNpdkEtLw0AUhQdRsEb3gpuAGzep92YenSxLfFOoUF0P0-SOpKSdmEnQ_ntTIi5cnc13Lvd8jF0iTBEhu31ZzfNpCiimKECiPGITlFInAKCP2QRmnCd6huqUnYWwgQEUOp2wdOG_ktxvm5q-q24fr7zrkmXfNX0X31Hhy2r3EXsXv_ratnHuSwrn7MTZOtDFb0bs_eH-LX9KFsvH53y-SAqeQZeI9TpNFaIlp5SWTgiZlaRTjihcgalFsGhLXZCTBJBxB6RRWkVKKcw4j9jNeLdp_WdPoTPbKhRU13ZHvg8G1TAHUA5sxK7_oRvft7vhO4NSSJ0JhWqgYKSK1ofQkjNNW21tuzcI5iDRHCSag0QzShwqV2OlIqI_XGkQmQD-A9-caoI</recordid><startdate>20140501</startdate><enddate>20140501</enddate><creator>Fayyaz, Ubaid U.</creator><creator>Barry, John R.</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><scope>F28</scope><scope>FR3</scope></search><sort><creationdate>20140501</creationdate><title>Low-Complexity Soft-Output Decoding of Polar Codes</title><author>Fayyaz, Ubaid U. ; Barry, John R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c390t-4bb22611aef6685f4459de823114fc12a10a1ad8cef5e0093f0e815a6e6661933</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithms</topic><topic>Belief propagation</topic><topic>Blocking</topic><topic>Channels</topic><topic>Complexity</topic><topic>Complexity theory</topic><topic>Decoders</topic><topic>Decoding</topic><topic>Iterative decoding</topic><topic>Memory management</topic><topic>Polar codes</topic><topic>Receivers</topic><topic>soft-output decoding</topic><topic>State of the art</topic><topic>turbo equalization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fayyaz, Ubaid U.</creatorcontrib><creatorcontrib>Barry, John R.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998–Present</collection><collection>IEL</collection><collection>CrossRef</collection><collection>Electronics &amp; Communications Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>ANTE: Abstracts in New Technology &amp; Engineering</collection><collection>Engineering Research Database</collection><jtitle>IEEE journal on selected areas in communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Fayyaz, Ubaid U.</au><au>Barry, John R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Low-Complexity Soft-Output Decoding of Polar Codes</atitle><jtitle>IEEE journal on selected areas in communications</jtitle><stitle>J-SAC</stitle><date>2014-05-01</date><risdate>2014</risdate><volume>32</volume><issue>5</issue><spage>958</spage><epage>966</epage><pages>958-966</pages><issn>0733-8716</issn><eissn>1558-0008</eissn><coden>ISACEM</coden><abstract>The state-of-the-art soft-output decoder for polar codes is a message-passing algorithm based on belief propagation, which performs well at the cost of high processing and storage requirements. In this paper, we propose a low-complexity alternative for soft-output decoding of polar codes that offers better performance but with significantly reduced processing and storage requirements. In particular we show that the complexity of the proposed decoder is only 4% of the total complexity of the belief propagation decoder for a rate one-half polar code of dimension 4096 in the dicode channel, while achieving comparable error-rate performance. Furthermore, we show that the proposed decoder requires about 39% of the memory required by the belief propagation decoder for a block length of 32768.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/JSAC.2014.140515</doi><tpages>9</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0733-8716
ispartof IEEE journal on selected areas in communications, 2014-05, Vol.32 (5), p.958-966
issn 0733-8716
1558-0008
language eng
recordid cdi_proquest_journals_1545894616
source IEL
subjects Algorithms
Belief propagation
Blocking
Channels
Complexity
Complexity theory
Decoders
Decoding
Iterative decoding
Memory management
Polar codes
Receivers
soft-output decoding
State of the art
turbo equalization
title Low-Complexity Soft-Output Decoding of Polar Codes
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-01T06%3A48%3A44IST&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=Low-Complexity%20Soft-Output%20Decoding%20of%20Polar%20Codes&rft.jtitle=IEEE%20journal%20on%20selected%20areas%20in%20communications&rft.au=Fayyaz,%20Ubaid%20U.&rft.date=2014-05-01&rft.volume=32&rft.issue=5&rft.spage=958&rft.epage=966&rft.pages=958-966&rft.issn=0733-8716&rft.eissn=1558-0008&rft.coden=ISACEM&rft_id=info:doi/10.1109/JSAC.2014.140515&rft_dat=%3Cproquest_RIE%3E1671601519%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=1545894616&rft_id=info:pmid/&rft_ieee_id=6804940&rfr_iscdi=true