Abstract
AbstractA latest coding scheme named polarization‐adjusted convolutional (PAC) codes is shown to approach the dispersion bound for the code (128,64) under list decoding. However, to achieve the near‐bound performance, the list size of list decoding needs to be excessively large, which leads to insufferable time complexity. In this paper, to improve the speed of list decoding, fast list decoders for PAC codes are proposed. Four types of constituent nodes are defined and fast list decoding algorithms are provided for each of them. Simulation results present that fast list decoding with three types of constituent nodes can yield exactly the same error‐correction performance as list decoding, and reduce more than 50% time steps for the code (128,64). Moreover, fast list decoding with four types of constituent nodes can further reduce decoding complexity with negligible performance degradation.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
