Loading…
Sequential Decoding of Polar Codes
The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be...
Saved in:
Published in: | IEEE communications letters 2014-07, Vol.18 (7), p.1127-1130 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c295t-5fb72779f686f98ec07ce0f9d9901783fd38d61b0c71a1e0d97de188b96afa1b3 |
---|---|
cites | cdi_FETCH-LOGICAL-c295t-5fb72779f686f98ec07ce0f9d9901783fd38d61b0c71a1e0d97de188b96afa1b3 |
container_end_page | 1130 |
container_issue | 7 |
container_start_page | 1127 |
container_title | IEEE communications letters |
container_volume | 18 |
creator | Miloslavkaya, V. Trifonov, P. |
description | The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended. |
doi_str_mv | 10.1109/LCOMM.2014.2323237 |
format | article |
fullrecord | <record><control><sourceid>proquest_ieee_</sourceid><recordid>TN_cdi_ieee_primary_6814768</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6814768</ieee_id><sourcerecordid>3388007421</sourcerecordid><originalsourceid>FETCH-LOGICAL-c295t-5fb72779f686f98ec07ce0f9d9901783fd38d61b0c71a1e0d97de188b96afa1b3</originalsourceid><addsrcrecordid>eNo9kE9LAzEQxYMoWKtfQC-LnrfOZDebyVHWv9BSQT2H7CaRLbWpSXvw25vaIgMzc3hv3vBj7BJhggjqdtrOZ7MJB6wnvNqVPGIjFIJKnttx3oFUKaWiU3aW0gIAiAscses39711q81glsW964MdVp9F8MVrWJpYtMG6dM5OvFkmd3GYY_bx-PDePpfT-dNLezcte67EphS-kzwn-IYar8j1IHsHXlmlACVV3lZkG-ygl2jQgVXSOiTqVGO8wa4as5v93XUM-ae00YuwjascqVHUStSVIsgqvlf1MaQUndfrOHyZ-KMR9I6F_mOhdyz0gUU2Xe1Ng3Pu39AQ1rKh6heeTFjV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1549543980</pqid></control><display><type>article</type><title>Sequential Decoding of Polar Codes</title><source>IEEE Xplore (Online service)</source><creator>Miloslavkaya, V. ; Trifonov, P.</creator><creatorcontrib>Miloslavkaya, V. ; Trifonov, P.</creatorcontrib><description>The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2014.2323237</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Arrays ; Complexity theory ; Decoding ; Heuristic algorithms ; Iterative decoding ; Random variables</subject><ispartof>IEEE communications letters, 2014-07, Vol.18 (7), p.1127-1130</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c295t-5fb72779f686f98ec07ce0f9d9901783fd38d61b0c71a1e0d97de188b96afa1b3</citedby><cites>FETCH-LOGICAL-c295t-5fb72779f686f98ec07ce0f9d9901783fd38d61b0c71a1e0d97de188b96afa1b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6814768$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,27924,27925,54796</link.rule.ids></links><search><creatorcontrib>Miloslavkaya, V.</creatorcontrib><creatorcontrib>Trifonov, P.</creatorcontrib><title>Sequential Decoding of Polar Codes</title><title>IEEE communications letters</title><addtitle>COML</addtitle><description>The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.</description><subject>Arrays</subject><subject>Complexity theory</subject><subject>Decoding</subject><subject>Heuristic algorithms</subject><subject>Iterative decoding</subject><subject>Random variables</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNo9kE9LAzEQxYMoWKtfQC-LnrfOZDebyVHWv9BSQT2H7CaRLbWpSXvw25vaIgMzc3hv3vBj7BJhggjqdtrOZ7MJB6wnvNqVPGIjFIJKnttx3oFUKaWiU3aW0gIAiAscses39711q81glsW964MdVp9F8MVrWJpYtMG6dM5OvFkmd3GYY_bx-PDePpfT-dNLezcte67EphS-kzwn-IYar8j1IHsHXlmlACVV3lZkG-ygl2jQgVXSOiTqVGO8wa4as5v93XUM-ae00YuwjascqVHUStSVIsgqvlf1MaQUndfrOHyZ-KMR9I6F_mOhdyz0gUU2Xe1Ng3Pu39AQ1rKh6heeTFjV</recordid><startdate>20140701</startdate><enddate>20140701</enddate><creator>Miloslavkaya, V.</creator><creator>Trifonov, P.</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>20140701</creationdate><title>Sequential Decoding of Polar Codes</title><author>Miloslavkaya, V. ; Trifonov, P.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c295t-5fb72779f686f98ec07ce0f9d9901783fd38d61b0c71a1e0d97de188b96afa1b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Arrays</topic><topic>Complexity theory</topic><topic>Decoding</topic><topic>Heuristic algorithms</topic><topic>Iterative decoding</topic><topic>Random variables</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Miloslavkaya, V.</creatorcontrib><creatorcontrib>Trifonov, P.</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Xplore</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</fulltext></delivery><addata><au>Miloslavkaya, V.</au><au>Trifonov, P.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Sequential Decoding of Polar Codes</atitle><jtitle>IEEE communications letters</jtitle><stitle>COML</stitle><date>2014-07-01</date><risdate>2014</risdate><volume>18</volume><issue>7</issue><spage>1127</spage><epage>1130</epage><pages>1127-1130</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>The problem of efficient decoding of polar codes is considered. A low-complexity sequential soft decision decoding algorithm is proposed. It is based on the successive cancellation approach, and it employs most likely codeword probability estimates for selection of a path within the code tree to be extended.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2014.2323237</doi><tpages>4</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1089-7798 |
ispartof | IEEE communications letters, 2014-07, Vol.18 (7), p.1127-1130 |
issn | 1089-7798 1558-2558 |
language | eng |
recordid | cdi_ieee_primary_6814768 |
source | IEEE Xplore (Online service) |
subjects | Arrays Complexity theory Decoding Heuristic algorithms Iterative decoding Random variables |
title | Sequential Decoding of Polar Codes |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T23%3A24%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_ieee_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Sequential%20Decoding%20of%20Polar%20Codes&rft.jtitle=IEEE%20communications%20letters&rft.au=Miloslavkaya,%20V.&rft.date=2014-07-01&rft.volume=18&rft.issue=7&rft.spage=1127&rft.epage=1130&rft.pages=1127-1130&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2014.2323237&rft_dat=%3Cproquest_ieee_%3E3388007421%3C/proquest_ieee_%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c295t-5fb72779f686f98ec07ce0f9d9901783fd38d61b0c71a1e0d97de188b96afa1b3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1549543980&rft_id=info:pmid/&rft_ieee_id=6814768&rfr_iscdi=true |