Partitioned Successive-Cancellation List Flip Decoding of Polar Codes
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866912010058334208 |
|---|---|
| author | Pillet, Charles Sagitov, Ilshat Domer, Grégoire Giard, Pascal |
| author_facet | Pillet, Charles Sagitov, Ilshat Domer, Grégoire Giard, Pascal |
| contents | The recently proposed Successive-Cancellation List Flip (SCLF) decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SC List (SCL) decoding. However, it comes at the cost of a higher complexity. In this paper, we propose the Partitioned SCLF decoding algorithm, an algorithm that divides a word in partitions and applies SCLF decoding to each partition separately. Compared to SCLF, PSCLF allows early termination but is more susceptible to cyclic-redundancy check (CRC) collisions. In order to maximize the coding gain, a new partition design tailored to PSCLF is proposed as well as the possibility to support different CRC lengths. Numerical results show that the proposed PSCLF algorithm has an error-correction performance gain of up to 0.15 dB with respect to SCLF. Moreover, the proposed CRC structure permits to mitigate the error-correction loss at low frame-error rate (FER) due to CRC collisions, showing a gain of 0.2 dB at $\text{FER}=10^{-4}$ with respect to the regular CRC structure. The average execution time of PSCLF is shown to be 1.5 times lower than that of SCLF, and matches the latency of SCLF at $\text{FER}=4\cdot10^{-3}$ and lower. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_00266 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Partitioned Successive-Cancellation List Flip Decoding of Polar Codes Pillet, Charles Sagitov, Ilshat Domer, Grégoire Giard, Pascal Information Theory The recently proposed Successive-Cancellation List Flip (SCLF) decoding algorithm for polar codes improves the error-correcting performance of state-of-the-art SC List (SCL) decoding. However, it comes at the cost of a higher complexity. In this paper, we propose the Partitioned SCLF decoding algorithm, an algorithm that divides a word in partitions and applies SCLF decoding to each partition separately. Compared to SCLF, PSCLF allows early termination but is more susceptible to cyclic-redundancy check (CRC) collisions. In order to maximize the coding gain, a new partition design tailored to PSCLF is proposed as well as the possibility to support different CRC lengths. Numerical results show that the proposed PSCLF algorithm has an error-correction performance gain of up to 0.15 dB with respect to SCLF. Moreover, the proposed CRC structure permits to mitigate the error-correction loss at low frame-error rate (FER) due to CRC collisions, showing a gain of 0.2 dB at $\text{FER}=10^{-4}$ with respect to the regular CRC structure. The average execution time of PSCLF is shown to be 1.5 times lower than that of SCLF, and matches the latency of SCLF at $\text{FER}=4\cdot10^{-3}$ and lower. |
| title | Partitioned Successive-Cancellation List Flip Decoding of Polar Codes |
| topic | Information Theory |
| url | https://arxiv.org/abs/2409.00266 |