A tree pruning technique for decoding complexity reduction of polar codes and PAC codes

Simple item page
buir.contributor.authorMoradi, Mohsen
buir.contributor.authorMozammel, Amir
buir.contributor.orcidMoradi, Mohsen|0000-0001-7026-0682
buir.contributor.orcidMozammel, Amir|0000-0003-3474-9530
dc.citation.epage2586en_US
dc.citation.issueNumber5
dc.citation.spage2576
dc.citation.volumeNumber71
dc.contributor.authorMoradi, Mohsen
dc.contributor.authorMozammel, Amir
dc.date.accessioned2024-03-18T11:42:46Z
dc.date.available2024-03-18T11:42:46Z
dc.date.issued2023-05-18
dc.description.abstractSorting 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.
dc.description.provenanceMade available in DSpace on 2024-03-18T11:42:46Z (GMT). No. of bitstreams: 1 A_tree_pruning_technique_for_decoding_complexity_reduction_of_polar_codes_and_PAC_codes.pdf: 3652199 bytes, checksum: aaf605c4126cea237d06aa9a439379a0 (MD5) Previous issue date: 2023-05-01en
dc.identifier.doi10.1109/TCOMM.2023.3255254
dc.identifier.eissn1558-0857
dc.identifier.issn0090-6778
dc.identifier.urihttps://hdl.handle.net/11693/114892
dc.language.isoEnglish
dc.publisherInstitute of Electrical and Electronics Engineers
dc.relation.isversionofhttps://dx.doi.org/10.1109/TCOMM.2023.3255254
dc.source.titleIEEE Transactions on Communications
dc.subjectPAC codes
dc.subjectPolar codes
dc.subjectSCL decoding
dc.subjectSequential decoding
dc.subjectPolarized channel
dc.subjectStack decoding
dc.subjectPruning
dc.titleA tree pruning technique for decoding complexity reduction of polar codes and PAC codes
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A_tree_pruning_technique_for_decoding_complexity_reduction_of_polar_codes_and_PAC_codes.pdf
Size:
3.48 MB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2.01 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Scholarly Publications - Electrical and Electronics Engineering