Sequential Polar Decoding with Cost Metric Threshold
Polar codes have established themselves as a cornerstone in modern error correction coding due to their capacity-achieving properties and practical implementation advantages. However, decoding polar codes remains a computationally intensive task. In this paper, we introduce a novel approach to impro...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2024-02-01
|
| Series: | Applied Sciences |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2076-3417/14/5/1847 |
| _version_ | 1827319827580059648 |
|---|---|
| author | Ilya Timokhin Fedor Ivanov |
| author_facet | Ilya Timokhin Fedor Ivanov |
| author_sort | Ilya Timokhin |
| collection | DOAJ |
| description | Polar codes have established themselves as a cornerstone in modern error correction coding due to their capacity-achieving properties and practical implementation advantages. However, decoding polar codes remains a computationally intensive task. In this paper, we introduce a novel approach to improve the decoding efficiency of polar codes by integrating the threshold-based SC-Creeper decoding algorithm, originally designed for convolutional codes. Our proposed decoder with an additional cost function seamlessly merges two established decoding paradigms, namely the stack and Fano approaches. The core idea is to leverage the strengths of both decoding techniques to strike a balance between computational efficiency and performance, with an additional method of controlling movement along a code tree. Simulations demonstrate the superiority of the proposed improved SC-Creeper decoder with tuned parameters. The improved SC-Creeper decoder achieves the performance of the CA-SCL-8 decoder in terms of high code rates and overcomes it in terms of the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>=</mo><mn>1024</mn></mrow></semantics></math></inline-formula> code length, while simultaneously surpassing the efficiency of the traditional Fano decoding algorithm. |
| first_indexed | 2024-04-25T00:35:11Z |
| format | Article |
| id | doaj.art-31721159e28f430a884a841c260bf559 |
| institution | Directory Open Access Journal |
| issn | 2076-3417 |
| language | English |
| last_indexed | 2024-04-25T00:35:11Z |
| publishDate | 2024-02-01 |
| publisher | MDPI AG |
| record_format | Article |
| series | Applied Sciences |
| spelling | doaj.art-31721159e28f430a884a841c260bf5592024-03-12T16:39:11ZengMDPI AGApplied Sciences2076-34172024-02-01145184710.3390/app14051847Sequential Polar Decoding with Cost Metric ThresholdIlya Timokhin0Fedor Ivanov1Higher School of Economics, National Research University, 101000 Moscow, RussiaHigher School of Economics, National Research University, 101000 Moscow, RussiaPolar codes have established themselves as a cornerstone in modern error correction coding due to their capacity-achieving properties and practical implementation advantages. However, decoding polar codes remains a computationally intensive task. In this paper, we introduce a novel approach to improve the decoding efficiency of polar codes by integrating the threshold-based SC-Creeper decoding algorithm, originally designed for convolutional codes. Our proposed decoder with an additional cost function seamlessly merges two established decoding paradigms, namely the stack and Fano approaches. The core idea is to leverage the strengths of both decoding techniques to strike a balance between computational efficiency and performance, with an additional method of controlling movement along a code tree. Simulations demonstrate the superiority of the proposed improved SC-Creeper decoder with tuned parameters. The improved SC-Creeper decoder achieves the performance of the CA-SCL-8 decoder in terms of high code rates and overcomes it in terms of the <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>N</mi><mo>=</mo><mn>1024</mn></mrow></semantics></math></inline-formula> code length, while simultaneously surpassing the efficiency of the traditional Fano decoding algorithm.https://www.mdpi.com/2076-3417/14/5/1847polar codessuccessive cancellation decodingFano decodingstack decodingCreeperthreshold |
| spellingShingle | Ilya Timokhin Fedor Ivanov Sequential Polar Decoding with Cost Metric Threshold Applied Sciences polar codes successive cancellation decoding Fano decoding stack decoding Creeper threshold |
| title | Sequential Polar Decoding with Cost Metric Threshold |
| title_full | Sequential Polar Decoding with Cost Metric Threshold |
| title_fullStr | Sequential Polar Decoding with Cost Metric Threshold |
| title_full_unstemmed | Sequential Polar Decoding with Cost Metric Threshold |
| title_short | Sequential Polar Decoding with Cost Metric Threshold |
| title_sort | sequential polar decoding with cost metric threshold |
| topic | polar codes successive cancellation decoding Fano decoding stack decoding Creeper threshold |
| url | https://www.mdpi.com/2076-3417/14/5/1847 |
| work_keys_str_mv | AT ilyatimokhin sequentialpolardecodingwithcostmetricthreshold AT fedorivanov sequentialpolardecodingwithcostmetricthreshold |