Application of guessing to sequential decoding of polarization-adjusted convolutional (PAC) codes

Simple item page
buir.contributor.authorMoradi, Mohsen
buir.contributor.orcidMoradi, Mohsen|0000-0001-7026-0682
dc.citation.epage4436en_US
dc.citation.issueNumber8
dc.citation.spage4425
dc.citation.volumeNumber71
dc.contributor.authorMoradi, Mohsen
dc.date.accessioned2024-03-18T12:49:02Z
dc.date.available2024-03-18T12:49:02Z
dc.date.issued2023-08-16
dc.description.abstractDespite the extreme error-correction performance, the amount of computation of sequential decoding of the polarization-adjusted convolutional (PAC) codes is random. In sequential decoding of convolutional codes, the cutoff rate denotes the region between rates whose average computational complexity of decoding is finite and those which is infinite. In this paper, by benefiting from the polarization and guessing techniques, we prove that the required computation in sequential decoding of pre-transformed polar codes polarizes, and this polarization determines which set of bit positions within the rate profile may result in high computational complexity. Based on this, we propose a technique for taming the Reed-Muller (RM) rate-profile construction, and the performance results demonstrate that the error-correction performance of the PAC codes can achieve the theoretical bounds using the tamed RM rate-profile construction and requires a significantly lower computational complexity than the RM rate-profile construction.
dc.description.provenanceMade available in DSpace on 2024-03-18T12:49:02Z (GMT). No. of bitstreams: 1 Application_of_guessing_to_sequential_decoding_of_polarization-adjusted_convolutional_(PAC)_codes.pdf: 5815472 bytes, checksum: 1eb1b175f3c65e5cbfedeb24fe9fba05 (MD5) Previous issue date: 2023-08-01en
dc.identifier.doi10.1109/TCOMM.2023.3280548
dc.identifier.eissn1558-0857
dc.identifier.issn0090-6778
dc.identifier.urihttps://hdl.handle.net/11693/114899
dc.language.isoEnglish
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.relation.isversionofhttps://dx.doi.org/10.1109/TCOMM.2023.3280548
dc.source.titleIEEE Transactions on Communications
dc.subjectPAC codes
dc.subjectSequential decoding
dc.subjectFano algorithm
dc.subjectPolar coding
dc.subjectChannel coding
dc.subjectGuessing
dc.subjectCutoff rate
dc.titleApplication of guessing to sequential decoding of polarization-adjusted convolutional (PAC) codes
dc.typeArticle

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Application_of_guessing_to_sequential_decoding_of_polarization-adjusted_convolutional_(PAC)_codes.pdf
Size:
5.54 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