Loading…
Stepped List Decoding for Polar Codes
In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introd...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference Proceeding |
| Language: | English |
| Subjects: | |
| Online Access: | Request full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| cited_by | |
|---|---|
| cites | |
| container_end_page | 5 |
| container_issue | |
| container_start_page | 1 |
| container_title | |
| container_volume | |
| creator | Rowshan, Mohammad Viterbo, Emanuele |
| description | In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process. Then, we advocate that the list size can change stepwise depending on PMR. As a result, we propose a stepped list decoding scheme in which the error correction performance of the conventional list decoding is preserved while the path memory may reduce by 75%, the size of the internal LLR memory and partial sums memory can drop by 50%, and the computational complexity may halve. The reduction in complexity is SNR-independent and achieved without introducing any computational overhead. |
| doi_str_mv | 10.1109/ISTC.2018.8625267 |
| format | conference_proceeding |
| fullrecord | <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_8625267</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>8625267</ieee_id><sourcerecordid>8625267</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-ada240fdabc009af3fd7a7d1d2423aa0601df3e8232638f7c0bfa298b523c6613</originalsourceid><addsrcrecordid>eNotz81Kw0AUQOFRKFhqHkDcZOMy8d47_0uJWgsBC63rcpOZkZFqQpKNb-_Crs7ugyPEHUKNCP5xdzg2NQG62hnSZOyVKLx1qKUzFpRT12JNaHSlLPobUczzFwBIdB4VrMXDYYnjGEPZ5nkpn2M_hPzzWaZhKvfDmaeyGUKcb8Uq8XmOxaUb8fH6cmzeqvZ9u2ue2iqj1UvFgUlBCtz1AJ6TTMGyDRhIkWQGAxiSjI4kGemS7aFLTN51mmRvDMqNuP93c4zxNE75m6ff02VM_gGpBT_d</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Stepped List Decoding for Polar Codes</title><source>IEEE Xplore All Conference Series</source><creator>Rowshan, Mohammad ; Viterbo, Emanuele</creator><creatorcontrib>Rowshan, Mohammad ; Viterbo, Emanuele</creatorcontrib><description>In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process. Then, we advocate that the list size can change stepwise depending on PMR. As a result, we propose a stepped list decoding scheme in which the error correction performance of the conventional list decoding is preserved while the path memory may reduce by 75%, the size of the internal LLR memory and partial sums memory can drop by 50%, and the computational complexity may halve. The reduction in complexity is SNR-independent and achieved without introducing any computational overhead.</description><identifier>EISSN: 2165-4719</identifier><identifier>EISBN: 9781538670484</identifier><identifier>EISBN: 1538670488</identifier><identifier>DOI: 10.1109/ISTC.2018.8625267</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computational complexity ; Decoding ; Error correction ; Iterative decoding ; Magnetic resonance imaging ; Measurement ; Memory management ; memory requirement ; Polar codes ; successive cancellation list decoding</subject><ispartof>2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018, p.1-5</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/8625267$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/8625267$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Rowshan, Mohammad</creatorcontrib><creatorcontrib>Viterbo, Emanuele</creatorcontrib><title>Stepped List Decoding for Polar Codes</title><title>2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)</title><addtitle>ISTC</addtitle><description>In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process. Then, we advocate that the list size can change stepwise depending on PMR. As a result, we propose a stepped list decoding scheme in which the error correction performance of the conventional list decoding is preserved while the path memory may reduce by 75%, the size of the internal LLR memory and partial sums memory can drop by 50%, and the computational complexity may halve. The reduction in complexity is SNR-independent and achieved without introducing any computational overhead.</description><subject>Computational complexity</subject><subject>Decoding</subject><subject>Error correction</subject><subject>Iterative decoding</subject><subject>Magnetic resonance imaging</subject><subject>Measurement</subject><subject>Memory management</subject><subject>memory requirement</subject><subject>Polar codes</subject><subject>successive cancellation list decoding</subject><issn>2165-4719</issn><isbn>9781538670484</isbn><isbn>1538670488</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2018</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotz81Kw0AUQOFRKFhqHkDcZOMy8d47_0uJWgsBC63rcpOZkZFqQpKNb-_Crs7ugyPEHUKNCP5xdzg2NQG62hnSZOyVKLx1qKUzFpRT12JNaHSlLPobUczzFwBIdB4VrMXDYYnjGEPZ5nkpn2M_hPzzWaZhKvfDmaeyGUKcb8Uq8XmOxaUb8fH6cmzeqvZ9u2ue2iqj1UvFgUlBCtz1AJ6TTMGyDRhIkWQGAxiSjI4kGemS7aFLTN51mmRvDMqNuP93c4zxNE75m6ff02VM_gGpBT_d</recordid><startdate>201812</startdate><enddate>201812</enddate><creator>Rowshan, Mohammad</creator><creator>Viterbo, Emanuele</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201812</creationdate><title>Stepped List Decoding for Polar Codes</title><author>Rowshan, Mohammad ; Viterbo, Emanuele</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-ada240fdabc009af3fd7a7d1d2423aa0601df3e8232638f7c0bfa298b523c6613</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2018</creationdate><topic>Computational complexity</topic><topic>Decoding</topic><topic>Error correction</topic><topic>Iterative decoding</topic><topic>Magnetic resonance imaging</topic><topic>Measurement</topic><topic>Memory management</topic><topic>memory requirement</topic><topic>Polar codes</topic><topic>successive cancellation list decoding</topic><toplevel>online_resources</toplevel><creatorcontrib>Rowshan, Mohammad</creatorcontrib><creatorcontrib>Viterbo, Emanuele</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE/IET Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rowshan, Mohammad</au><au>Viterbo, Emanuele</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Stepped List Decoding for Polar Codes</atitle><btitle>2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC)</btitle><stitle>ISTC</stitle><date>2018-12</date><risdate>2018</risdate><spage>1</spage><epage>5</epage><pages>1-5</pages><eissn>2165-4719</eissn><eisbn>9781538670484</eisbn><eisbn>1538670488</eisbn><abstract>In the successive cancellation list (SCL) decoding of polar codes, as the list size increases, the error correction performance improves. However, a large list size results in high computational complexity and large memory requirement.In this paper, we investigate the list decoding process by introducing a new parameter named path metric range (PMR) to elucidate the properties of the evolution of the path metrics (PMs) within the list throughout the decoding process. Then, we advocate that the list size can change stepwise depending on PMR. As a result, we propose a stepped list decoding scheme in which the error correction performance of the conventional list decoding is preserved while the path memory may reduce by 75%, the size of the internal LLR memory and partial sums memory can drop by 50%, and the computational complexity may halve. The reduction in complexity is SNR-independent and achieved without introducing any computational overhead.</abstract><pub>IEEE</pub><doi>10.1109/ISTC.2018.8625267</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | EISSN: 2165-4719 |
| ispartof | 2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018, p.1-5 |
| issn | 2165-4719 |
| language | eng |
| recordid | cdi_ieee_primary_8625267 |
| source | IEEE Xplore All Conference Series |
| subjects | Computational complexity Decoding Error correction Iterative decoding Magnetic resonance imaging Measurement Memory management memory requirement Polar codes successive cancellation list decoding |
| title | Stepped List Decoding for 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-29T06%3A43%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Stepped%20List%20Decoding%20for%20Polar%20Codes&rft.btitle=2018%20IEEE%2010th%20International%20Symposium%20on%20Turbo%20Codes%20&%20Iterative%20Information%20Processing%20(ISTC)&rft.au=Rowshan,%20Mohammad&rft.date=2018-12&rft.spage=1&rft.epage=5&rft.pages=1-5&rft.eissn=2165-4719&rft_id=info:doi/10.1109/ISTC.2018.8625267&rft.eisbn=9781538670484&rft.eisbn_list=1538670488&rft_dat=%3Cieee_CHZPO%3E8625267%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-ada240fdabc009af3fd7a7d1d2423aa0601df3e8232638f7c0bfa298b523c6613%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=8625267&rfr_iscdi=true |