Performance and Complexity of Sequential Decoding of PAC Codes
Mohsen Moradi, Amir Mozammel, Kangjian Qin, Erdal Arikan
TL;DR
This paper analyzes the performance and computational complexity of sequential decoding for PAC codes, comparing them with 5G polar and convolutional codes, and proposes a method to bound decoding complexity.
Contribution
It introduces a new method to bound the complexity of sequential decoding of PAC codes and provides a comparative analysis with existing coding schemes.
Findings
PAC codes show competitive performance with 5G polar codes.
The proposed bounding method effectively estimates decoding complexity.
Sequential decoding complexity varies with code parameters.
Abstract
Performance and complexity of sequential decoding of polarization-adjusted convolutional (PAC) codes is studied. In particular, a performance and computational complexity comparison of PAC codes with 5G polar codes and convolutional codes is given. A method for bounding the complexity of sequential decoding of PAC codes is proposed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · Coding theory and cryptography