Low Complexity Successive Cancellation Decoding of Polar Codes based on Pruning Strategy in Deletion Error Channels
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910453690531840 |
|---|---|
| author | Sun, He Liu, Rongke Dai, Bin |
| author_facet | Sun, He Liu, Rongke Dai, Bin |
| contents | A novel SC decoding method of polar codes is proposed in $d$-deletion channels, where a new pruning strategy is designed to reduce decoding complexity. Considering the difference of the scenario weight distributions, pruning thresholds for each node are designed separately according to a uniform constraint on the pruning error probability, which further reduce the number of scenarios that need to be calculated during the decoding procedure. In addition, by exploiting the properties of the joint weight distribution, a simplified calculation method of thresholds is proposed. Using this simplified calculation method, the number of scenarios that required to be calculated is reduced from $(d+1)(d+2)/2$ to $d+1$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_12245 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Low Complexity Successive Cancellation Decoding of Polar Codes based on Pruning Strategy in Deletion Error Channels Sun, He Liu, Rongke Dai, Bin Information Theory A novel SC decoding method of polar codes is proposed in $d$-deletion channels, where a new pruning strategy is designed to reduce decoding complexity. Considering the difference of the scenario weight distributions, pruning thresholds for each node are designed separately according to a uniform constraint on the pruning error probability, which further reduce the number of scenarios that need to be calculated during the decoding procedure. In addition, by exploiting the properties of the joint weight distribution, a simplified calculation method of thresholds is proposed. Using this simplified calculation method, the number of scenarios that required to be calculated is reduced from $(d+1)(d+2)/2$ to $d+1$. |
| title | Low Complexity Successive Cancellation Decoding of Polar Codes based on Pruning Strategy in Deletion Error Channels |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.12245 |