SSRFSC flipping decoding algorithm based on critical simplification set for polar codes
To improve the decoding performance of the simplified sequence repetition node-based fast successive cancellation (SSRFSC) decoding algorithm, a decoding algorithm (CSS-SSR-Flip) based on critical simplified set (CSS) and simplified sequence repetition (SSR) nodes was designed. Firstly, the informat...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2024-10-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024171/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537113609207808 |
|---|---|
| author | GUO Rui LIU Yang HE Meilin LIU Zhaoting ZHAO Yinan |
| author_facet | GUO Rui LIU Yang HE Meilin LIU Zhaoting ZHAO Yinan |
| author_sort | GUO Rui |
| collection | DOAJ |
| description | To improve the decoding performance of the simplified sequence repetition node-based fast successive cancellation (SSRFSC) decoding algorithm, a decoding algorithm (CSS-SSR-Flip) based on critical simplified set (CSS) and simplified sequence repetition (SSR) nodes was designed. Firstly, the information bit of the longest repetition (REP) node in SSR was selected as candidate bit (CB), thus constructing a CSS based on SSR. Corresponding flip metrics and flip criterion were designed according to the decoding characteristics of SSR nodes. Secondly, the CB reliability was measured by considering the influence of repetition sequences and the source of SSR nodes on decoding, and suboptimal repetition sequences were selected to complete SSR node flip operations during specific CB flips. Experimental data shows that at frame error rates of <inline-formula><alternatives><math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><msup><mrow><mn mathvariant="normal">10</mn></mrow><mrow><mo>-</mo><mn mathvariant="normal">3</mn></mrow></msup></math><graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/21552BC7-E00E-4802-B7F8-045B98659DAF-M002.jpg"><?fx-imagestate width="5.41866684" height="2.53999996"?></graphic><graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/21552BC7-E00E-4802-B7F8-045B98659DAF-M002c.jpg"><?fx-imagestate width="5.41866684" height="2.53999996"?></graphic></alternatives></inline-formula>, CSS-SSR-Flip decoding algorithm is able to obtain more than 0.1 dB performance gain compared to the traditional fast simplified successive cancellation filp (Fast-SSC-Flip) decoding algorithm, and has the same decoding performance as the new Fast-SSC-Flip (New-Fast-SSC-Flip) decoding algorithm. However, compared to the traditional flip set size <italic>K</italic>, the CSS size of the proposed algorithm is reduced by up to 79.5%, and compared to the critical set (CS), the set size can be reduced by up to 23.1%. |
| format | Article |
| id | doaj-art-31d4eb874f6244729fd8669bb825e228 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2024-10-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-31d4eb874f6244729fd8669bb825e2282025-01-14T08:46:09ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2024-10-01459510677078115SSRFSC flipping decoding algorithm based on critical simplification set for polar codesGUO RuiLIU YangHE MeilinLIU ZhaotingZHAO YinanTo improve the decoding performance of the simplified sequence repetition node-based fast successive cancellation (SSRFSC) decoding algorithm, a decoding algorithm (CSS-SSR-Flip) based on critical simplified set (CSS) and simplified sequence repetition (SSR) nodes was designed. Firstly, the information bit of the longest repetition (REP) node in SSR was selected as candidate bit (CB), thus constructing a CSS based on SSR. Corresponding flip metrics and flip criterion were designed according to the decoding characteristics of SSR nodes. Secondly, the CB reliability was measured by considering the influence of repetition sequences and the source of SSR nodes on decoding, and suboptimal repetition sequences were selected to complete SSR node flip operations during specific CB flips. Experimental data shows that at frame error rates of <inline-formula><alternatives><math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2"><msup><mrow><mn mathvariant="normal">10</mn></mrow><mrow><mo>-</mo><mn mathvariant="normal">3</mn></mrow></msup></math><graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/21552BC7-E00E-4802-B7F8-045B98659DAF-M002.jpg"><?fx-imagestate width="5.41866684" height="2.53999996"?></graphic><graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/21552BC7-E00E-4802-B7F8-045B98659DAF-M002c.jpg"><?fx-imagestate width="5.41866684" height="2.53999996"?></graphic></alternatives></inline-formula>, CSS-SSR-Flip decoding algorithm is able to obtain more than 0.1 dB performance gain compared to the traditional fast simplified successive cancellation filp (Fast-SSC-Flip) decoding algorithm, and has the same decoding performance as the new Fast-SSC-Flip (New-Fast-SSC-Flip) decoding algorithm. However, compared to the traditional flip set size <italic>K</italic>, the CSS size of the proposed algorithm is reduced by up to 79.5%, and compared to the critical set (CS), the set size can be reduced by up to 23.1%.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024171/polar codeFast-SSCSSR nodecritical simplified setflipping decoding |
| spellingShingle | GUO Rui LIU Yang HE Meilin LIU Zhaoting ZHAO Yinan SSRFSC flipping decoding algorithm based on critical simplification set for polar codes Tongxin xuebao polar code Fast-SSC SSR node critical simplified set flipping decoding |
| title | SSRFSC flipping decoding algorithm based on critical simplification set for polar codes |
| title_full | SSRFSC flipping decoding algorithm based on critical simplification set for polar codes |
| title_fullStr | SSRFSC flipping decoding algorithm based on critical simplification set for polar codes |
| title_full_unstemmed | SSRFSC flipping decoding algorithm based on critical simplification set for polar codes |
| title_short | SSRFSC flipping decoding algorithm based on critical simplification set for polar codes |
| title_sort | ssrfsc flipping decoding algorithm based on critical simplification set for polar codes |
| topic | polar code Fast-SSC SSR node critical simplified set flipping decoding |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2024171/ |
| work_keys_str_mv | AT guorui ssrfscflippingdecodingalgorithmbasedoncriticalsimplificationsetforpolarcodes AT liuyang ssrfscflippingdecodingalgorithmbasedoncriticalsimplificationsetforpolarcodes AT hemeilin ssrfscflippingdecodingalgorithmbasedoncriticalsimplificationsetforpolarcodes AT liuzhaoting ssrfscflippingdecodingalgorithmbasedoncriticalsimplificationsetforpolarcodes AT zhaoyinan ssrfscflippingdecodingalgorithmbasedoncriticalsimplificationsetforpolarcodes |