A tree pruning technique for decoding complexity reduction of polar codes and PAC codes
Uloženo v:
| Název: | A tree pruning technique for decoding complexity reduction of polar codes and PAC codes |
|---|---|
| Autoři: | Moradi, Mohsen, Mozammel, Amir |
| Zdroj: | IEEE Transactions on Communications |
| Informace o vydavateli: | Institute of Electrical and Electronics Engineers |
| Rok vydání: | 2023 |
| Sbírka: | Bilkent University: Institutional Repository |
| Témata: | PAC codes, Polar codes, SCL decoding, Sequential decoding, Polarized channel, Stack decoding, Pruning |
| Popis: | Sorting operation is one of the main bottlenecks for the successive-cancellation list (SCL) decoding. This paper introduces an improvement to the SCL decoding for polar and pre-transformed polar codes that reduces the number of sorting operations without visible degradation in the code’s error correction performance. In an SCL decoding with an optimum metric function we show that, on average, the correct branch’s bit-metric value must be equal to the bit-channel capacity, and on the other hand, the average bit-metric value of a wrong branch can be at most zero. This implies that a wrong path’s partial path metric value deviates from the bit-channel capacity’s partial summation. For relatively reliable bit-channels, the bit metric for a wrong branch becomes very large negative number, which enables us to detect and prune such paths. We prove that, for a threshold lower than the bit-channel cutoff rate, the probability of pruning the correct path decreases exponentially by the given threshold. Based on these findings, we presented a pruning technique, and the experimental results demonstrate a substantial decrease in the amount of sorting procedures required for SCL decoding. In the stack algorithm, a similar technique is used to significantly reduce the average number of paths in the stack. |
| Druh dokumentu: | article in journal/newspaper |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| Relation: | https://dx.doi.org/10.1109/TCOMM.2023.3255254; https://hdl.handle.net/11693/114892 |
| DOI: | 10.1109/TCOMM.2023.3255254 |
| Dostupnost: | https://hdl.handle.net/11693/114892 https://doi.org/10.1109/TCOMM.2023.3255254 |
| Přístupové číslo: | edsbas.F0C04F15 |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | Sorting operation is one of the main bottlenecks for the successive-cancellation list (SCL) decoding. This paper introduces an improvement to the SCL decoding for polar and pre-transformed polar codes that reduces the number of sorting operations without visible degradation in the code’s error correction performance. In an SCL decoding with an optimum metric function we show that, on average, the correct branch’s bit-metric value must be equal to the bit-channel capacity, and on the other hand, the average bit-metric value of a wrong branch can be at most zero. This implies that a wrong path’s partial path metric value deviates from the bit-channel capacity’s partial summation. For relatively reliable bit-channels, the bit metric for a wrong branch becomes very large negative number, which enables us to detect and prune such paths. We prove that, for a threshold lower than the bit-channel cutoff rate, the probability of pruning the correct path decreases exponentially by the given threshold. Based on these findings, we presented a pruning technique, and the experimental results demonstrate a substantial decrease in the amount of sorting procedures required for SCL decoding. In the stack algorithm, a similar technique is used to significantly reduce the average number of paths in the stack. |
|---|---|
| DOI: | 10.1109/TCOMM.2023.3255254 |