Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes
The ordered statistic decoding (OSD) algorithm for short-length linear block codes provides an attractive ML-approaching performance, expected to be used for the ultra-reliable low latency communication (URLLC) at the next-generation wireless solutions. To find the corrected codeword among numerous...
Gespeichert in:
| Veröffentlicht in: | IEEE communications letters 2022-08, Vol.26 (8), p.1720-1724 |
|---|---|
| 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 | 1724 |
|---|---|
| container_issue | 8 |
| container_start_page | 1720 |
| container_title | IEEE communications letters |
| container_volume | 26 |
| creator | Kim, Changhyeon Kam, Dongyun Kim, Seokki Park, Giyoon Lee, Youngjoo |
| description | The ordered statistic decoding (OSD) algorithm for short-length linear block codes provides an attractive ML-approaching performance, expected to be used for the ultra-reliable low latency communication (URLLC) at the next-generation wireless solutions. To find the corrected codeword among numerous candidates, however, the decoding process requires a considerable amount of computational costs, which need to be simplified to achieve low-latency processing. In this letter, we present several schemes that relax the overall complexity of the state-of-the-art segmentation discarding algorithm. Without degrading the error-correcting power, our method approximate the internal steps for computing the segment sizes and the stopping bounds at the run time, reducing the average processing costs by 1.6\times 10 ^{4} times for achieving the low-BLER performance. |
| doi_str_mv | 10.1109/LCOMM.2022.3176646 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_RIE</sourceid><recordid>TN_cdi_ieee_primary_9779155</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>9779155</ieee_id><sourcerecordid>2703438453</sourcerecordid><originalsourceid>FETCH-LOGICAL-c176t-482e7a3a08b5f2121cf364707fa69a4b146cc068b7f1eea3176e692a8f9fe6a33</originalsourceid><addsrcrecordid>eNo9kDtPwzAUhS0EEqXwB2CJxJziR2I7I4RXpVQdCrPlOtetSxsXOx349zi0YrnnDufcx4fQLcETQnD10NTz2WxCMaUTRgTnBT9DI1KWMqepnKceyyoXopKX6CrGDcZY0pKM0HThdvutsw7abB5aCEkXve5d7J3JnsH41nWrzPqQLdY-9HkD3apfZ43rQIfsaevNV1b7FuI1urB6G-HmpGP0-fryUb_nzfxtWj82uUmH9XkhKQjNNJbL0lJCibGMFwILq3mliyUpuDGYy6WwBEAP3wCvqJa2ssA1Y2N0f5y7D_77ALFXG38IXVqpqMCsYLIoBxc9ukzwMQawah_cTocfRbAakKk_ZGpApk7IUujuGHIA8B-oEraEkv0CGF5m9w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2703438453</pqid></control><display><type>article</type><title>Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes</title><source>IEEE Electronic Library (IEL)</source><creator>Kim, Changhyeon ; Kam, Dongyun ; Kim, Seokki ; Park, Giyoon ; Lee, Youngjoo</creator><creatorcontrib>Kim, Changhyeon ; Kam, Dongyun ; Kim, Seokki ; Park, Giyoon ; Lee, Youngjoo</creatorcontrib><description>The ordered statistic decoding (OSD) algorithm for short-length linear block codes provides an attractive ML-approaching performance, expected to be used for the ultra-reliable low latency communication (URLLC) at the next-generation wireless solutions. To find the corrected codeword among numerous candidates, however, the decoding process requires a considerable amount of computational costs, which need to be simplified to achieve low-latency processing. In this letter, we present several schemes that relax the overall complexity of the state-of-the-art segmentation discarding algorithm. Without degrading the error-correcting power, our method approximate the internal steps for computing the segment sizes and the stopping bounds at the run time, reducing the average processing costs by <inline-formula> <tex-math notation="LaTeX">1.6\times 10 ^{4} </tex-math></inline-formula> times for achieving the low-BLER performance.</description><identifier>ISSN: 1089-7798</identifier><identifier>EISSN: 1558-2558</identifier><identifier>DOI: 10.1109/LCOMM.2022.3176646</identifier><identifier>CODEN: ICLEF6</identifier><language>eng</language><publisher>New York: IEEE</publisher><subject>Algorithms ; Approximation algorithms ; Block codes ; Complexity theory ; Computing costs ; Costs ; Decoding ; Error correction ; Linear block codes ; Network latency ; Optimized production technology ; ordered statistic decoding ; Reliability ; Segmentation ; Ultra reliable low latency communication ; ultra-reliable low-latency communications ; Wireless communications</subject><ispartof>IEEE communications letters, 2022-08, Vol.26 (8), p.1720-1724</ispartof><rights>Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2022</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c176t-482e7a3a08b5f2121cf364707fa69a4b146cc068b7f1eea3176e692a8f9fe6a33</cites><orcidid>0000-0002-6336-9572 ; 0000-0002-8055-4577 ; 0000-0002-1750-8279 ; 0000-0002-2467-8276 ; 0000-0002-8542-1845</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/9779155$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27924,27925,54758</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/9779155$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kim, Changhyeon</creatorcontrib><creatorcontrib>Kam, Dongyun</creatorcontrib><creatorcontrib>Kim, Seokki</creatorcontrib><creatorcontrib>Park, Giyoon</creatorcontrib><creatorcontrib>Lee, Youngjoo</creatorcontrib><title>Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes</title><title>IEEE communications letters</title><addtitle>LCOMM</addtitle><description>The ordered statistic decoding (OSD) algorithm for short-length linear block codes provides an attractive ML-approaching performance, expected to be used for the ultra-reliable low latency communication (URLLC) at the next-generation wireless solutions. To find the corrected codeword among numerous candidates, however, the decoding process requires a considerable amount of computational costs, which need to be simplified to achieve low-latency processing. In this letter, we present several schemes that relax the overall complexity of the state-of-the-art segmentation discarding algorithm. Without degrading the error-correcting power, our method approximate the internal steps for computing the segment sizes and the stopping bounds at the run time, reducing the average processing costs by <inline-formula> <tex-math notation="LaTeX">1.6\times 10 ^{4} </tex-math></inline-formula> times for achieving the low-BLER performance.</description><subject>Algorithms</subject><subject>Approximation algorithms</subject><subject>Block codes</subject><subject>Complexity theory</subject><subject>Computing costs</subject><subject>Costs</subject><subject>Decoding</subject><subject>Error correction</subject><subject>Linear block codes</subject><subject>Network latency</subject><subject>Optimized production technology</subject><subject>ordered statistic decoding</subject><subject>Reliability</subject><subject>Segmentation</subject><subject>Ultra reliable low latency communication</subject><subject>ultra-reliable low-latency communications</subject><subject>Wireless communications</subject><issn>1089-7798</issn><issn>1558-2558</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9kDtPwzAUhS0EEqXwB2CJxJziR2I7I4RXpVQdCrPlOtetSxsXOx349zi0YrnnDufcx4fQLcETQnD10NTz2WxCMaUTRgTnBT9DI1KWMqepnKceyyoXopKX6CrGDcZY0pKM0HThdvutsw7abB5aCEkXve5d7J3JnsH41nWrzPqQLdY-9HkD3apfZ43rQIfsaevNV1b7FuI1urB6G-HmpGP0-fryUb_nzfxtWj82uUmH9XkhKQjNNJbL0lJCibGMFwILq3mliyUpuDGYy6WwBEAP3wCvqJa2ssA1Y2N0f5y7D_77ALFXG38IXVqpqMCsYLIoBxc9ukzwMQawah_cTocfRbAakKk_ZGpApk7IUujuGHIA8B-oEraEkv0CGF5m9w</recordid><startdate>20220801</startdate><enddate>20220801</enddate><creator>Kim, Changhyeon</creator><creator>Kam, Dongyun</creator><creator>Kim, Seokki</creator><creator>Park, Giyoon</creator><creator>Lee, Youngjoo</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-0002-6336-9572</orcidid><orcidid>https://orcid.org/0000-0002-8055-4577</orcidid><orcidid>https://orcid.org/0000-0002-1750-8279</orcidid><orcidid>https://orcid.org/0000-0002-2467-8276</orcidid><orcidid>https://orcid.org/0000-0002-8542-1845</orcidid></search><sort><creationdate>20220801</creationdate><title>Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes</title><author>Kim, Changhyeon ; Kam, Dongyun ; Kim, Seokki ; Park, Giyoon ; Lee, Youngjoo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c176t-482e7a3a08b5f2121cf364707fa69a4b146cc068b7f1eea3176e692a8f9fe6a33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Approximation algorithms</topic><topic>Block codes</topic><topic>Complexity theory</topic><topic>Computing costs</topic><topic>Costs</topic><topic>Decoding</topic><topic>Error correction</topic><topic>Linear block codes</topic><topic>Network latency</topic><topic>Optimized production technology</topic><topic>ordered statistic decoding</topic><topic>Reliability</topic><topic>Segmentation</topic><topic>Ultra reliable low latency communication</topic><topic>ultra-reliable low-latency communications</topic><topic>Wireless communications</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Changhyeon</creatorcontrib><creatorcontrib>Kam, Dongyun</creatorcontrib><creatorcontrib>Kim, Seokki</creatorcontrib><creatorcontrib>Park, Giyoon</creatorcontrib><creatorcontrib>Lee, Youngjoo</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 communications letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kim, Changhyeon</au><au>Kam, Dongyun</au><au>Kim, Seokki</au><au>Park, Giyoon</au><au>Lee, Youngjoo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes</atitle><jtitle>IEEE communications letters</jtitle><stitle>LCOMM</stitle><date>2022-08-01</date><risdate>2022</risdate><volume>26</volume><issue>8</issue><spage>1720</spage><epage>1724</epage><pages>1720-1724</pages><issn>1089-7798</issn><eissn>1558-2558</eissn><coden>ICLEF6</coden><abstract>The ordered statistic decoding (OSD) algorithm for short-length linear block codes provides an attractive ML-approaching performance, expected to be used for the ultra-reliable low latency communication (URLLC) at the next-generation wireless solutions. To find the corrected codeword among numerous candidates, however, the decoding process requires a considerable amount of computational costs, which need to be simplified to achieve low-latency processing. In this letter, we present several schemes that relax the overall complexity of the state-of-the-art segmentation discarding algorithm. Without degrading the error-correcting power, our method approximate the internal steps for computing the segment sizes and the stopping bounds at the run time, reducing the average processing costs by <inline-formula> <tex-math notation="LaTeX">1.6\times 10 ^{4} </tex-math></inline-formula> times for achieving the low-BLER performance.</abstract><cop>New York</cop><pub>IEEE</pub><doi>10.1109/LCOMM.2022.3176646</doi><tpages>5</tpages><orcidid>https://orcid.org/0000-0002-6336-9572</orcidid><orcidid>https://orcid.org/0000-0002-8055-4577</orcidid><orcidid>https://orcid.org/0000-0002-1750-8279</orcidid><orcidid>https://orcid.org/0000-0002-2467-8276</orcidid><orcidid>https://orcid.org/0000-0002-8542-1845</orcidid></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 1089-7798 |
| ispartof | IEEE communications letters, 2022-08, Vol.26 (8), p.1720-1724 |
| issn | 1089-7798 1558-2558 |
| language | eng |
| recordid | cdi_ieee_primary_9779155 |
| source | IEEE Electronic Library (IEL) |
| subjects | Algorithms Approximation algorithms Block codes Complexity theory Computing costs Costs Decoding Error correction Linear block codes Network latency Optimized production technology ordered statistic decoding Reliability Segmentation Ultra reliable low latency communication ultra-reliable low-latency communications Wireless communications |
| title | Simplified Ordered Statistic Decoding for Short-Length Linear Block Codes |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T14%3A13%3A20IST&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=Simplified%20Ordered%20Statistic%20Decoding%20for%20Short-Length%20Linear%20Block%20Codes&rft.jtitle=IEEE%20communications%20letters&rft.au=Kim,%20Changhyeon&rft.date=2022-08-01&rft.volume=26&rft.issue=8&rft.spage=1720&rft.epage=1724&rft.pages=1720-1724&rft.issn=1089-7798&rft.eissn=1558-2558&rft.coden=ICLEF6&rft_id=info:doi/10.1109/LCOMM.2022.3176646&rft_dat=%3Cproquest_RIE%3E2703438453%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=2703438453&rft_id=info:pmid/&rft_ieee_id=9779155&rfr_iscdi=true |